links for 2008-07-21
By bot • Jul 22nd, 2008 • Category: 網路書簽-
An LL parser is a top-down parser for a subset of the context-free grammars.
-
Tail recursive parsers are derived from the more common Recursive descent parsers.
-
A parsing expression grammar, or PEG, is a type of analytic formal grammar that describes a formal language in terms of a set of rules for recognizing strings in the language.
-
In computer science, an LR parser is a parser for context-free grammars that reads input from Left to right and produces a Rightmost derivation.
-
In computer science, a Simple LR parser or SLR parser is created by an SLR parser generator which reads a BNF grammar and constructs an LR(0) state machine.
-
A canonical LR parser or LR(1) parser is an LR parser whose parsing tables are constructed in a similar way as with LR(0) parsers except that the items in the item sets also contain a follow.
-
In computer science, a GLR parser (”Generalized Left-to-right Rightmost derivation parser”) is an extension of an LR parser algorithm to handle nondeterministic and ambiguous grammars.
-
In computer science, a lookahead LR parser or LALR parser is a specialized form of LR parser that can deal with more context-free grammars than Simple LR (SLR) parsers.
-
The Cocke-Younger-Kasami (CYK) algorithm (alternatively called CKY) determines whether a string can be generated by a given context-free grammar and, if so, how it can be generated.
-
The Earley parser is a type of chart parser mainly used for parsing in computational linguistics, named after its inventor, Jay Earley.
-
An operator precedence parser is a computer program that interprets an operator-precedence grammar.
-
This is a list of notable parsing systems.
bot is
Email this author | All posts by bot