parser LALR (look-ahead LR) parser Operator-precedence parser SLR (Simple LR) parser Simple precedence parser Packrat parser: a linear time parsing algorithm...

computer science, an LL parser (Left-to-right, leftmost derivation) is a top-down parser for a restricted context-free language. It parses the input from Left...

In computer science, an LALR parser (look-ahead, left-to-right, rightmost derivation parser) is part of the compiling process where human readable text...

shift-reduce parser, and does bottom-up parsing. A formal grammar that contains left recursion cannot be parsed by a naive recursive descent parser unless they...

ahead of the parser. The lookahead symbols are the 'right-hand context' for the parsing decision. Like other shift-reduce parsers, an LR parser lazily waits...

In computer science, a recursive descent parser is a kind of top-down parser built from a set of mutually recursive procedures (or a non-recursive equivalent)...

In computer science, the Earley parser is an algorithm for parsing strings that belong to a given context-free language, though (depending on the variant)...

Look up Parse, parse, or parser in Wiktionary, the free dictionary. Parse normally refers to parsing, the process of analyzing text. Parse or parser may also...

parser combinator is a higher-order function that accepts several parsers as input and returns a new parser as its output. In this context, a parser is...

typed local variables in the code doing the parsing, while SAX, for instance, typically requires a parser to manually maintain intermediate data within...