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) it may suffer problems with certain nullable grammars.[1] The algorithm, named after its inventor, Jay Earley, is a chart parser that uses dynamic programming; it is mainly used for parsing in computational linguistics. It was first introduced in his dissertation[2] in 1968 (and later appeared in an abbreviated, more legible, form in a journal[3]).
Earley parsers are appealing because they can parse all context-free languages, unlike LR parsers and LL parsers, which are more typically used in compilers but which can only handle restricted classes of languages. The Earley parser executes in cubic time in the general case , where n is the length of the parsed string, quadratic time for unambiguous grammars ,[4] and linear time for all deterministic context-free grammars. It performs particularly well when the rules are written left-recursively.
^Kegler, Jeffrey. "What is the Marpa algorithm?". Retrieved 20 August 2013.
^Earley, Jay (1968). An Efficient Context-Free Parsing Algorithm(PDF). Carnegie-Mellon Dissertation. Archived from the original (PDF) on 2017-09-22. Retrieved 2012-09-12.
^Earley, Jay (1970), "An efficient context-free parsing algorithm" (PDF), Communications of the ACM, 13 (2): 94–102, doi:10.1145/362007.362035, S2CID 47032707, archived from the original (PDF) on 2004-07-08
^John E. Hopcroft and Jeffrey D. Ullman (1979). Introduction to Automata Theory, Languages, and Computation. Reading/MA: Addison-Wesley. ISBN 978-0-201-02988-8. p.145
In computer science, the Earleyparser is an algorithm for parsing strings that belong to a given context-free language, though (depending on the variant)...
A GLR parser (generalized left-to-right rightmost derivation parser) is an extension of an LR parser algorithm to handle non-deterministic and ambiguous...
possible. In 1970, Jay Earley invented what came to be known as the Earleyparser. Earleyparsers are appealing because they can parse all context-free languages...
In computer science, a chart parser is a type of parser suitable for ambiguous grammars (including grammars of natural languages). It uses the dynamic...
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...
to a constant-size grammar. GLR parserEarleyparser Packrat parser Inside–outside algorithm Grune, Dick (2008). Parsing techniques : a practical guide...
Jay Earley is an American computer scientist and psychologist. He invented the Earleyparser in his early career in computer science. Later he became a...
The Packrat parser is a type of parser that shares similarities with the recursive descent parser in its construction. However, it differs because it...
Norvig increased the power of the parser through memoization, the augmented parser was still as time complex as Earley's algorithm, which demonstrates a...
have cubic time complexity, corresponding to the complexity of the Earleyparser on general context-free grammars. Quotient of a formal language George...
processing, where it was called Earleyparsing. It consists of storing in a table (a.k.a. chart in the context of parsing) partial successful analyses that...
producteurs de phonogrammes en France; see SourceForge Shared Packed Parse Forest, see Earleyparser This disambiguation page lists articles associated with the...
for parsing context-free grammars in Chomsky normal form Earleyparser: another O(n3) algorithm for parsing any context-free grammar GLR parser: an algorithm...
Association Mini-automatic radar plotting aid Earleyparser, one variant of which is the Marpa parser This disambiguation page lists articles associated...
language with syntax and semantics that are mutable at runtime π - another programming language with extensible syntax, implemented using an Earleyparser...
The non-deterministic features include an Earleyparser generator used for natural language processing. Parsers generated by SYNTAX include powerful error...
context-sensitive parsing rules, so the overall phrase grammar is unambiguous.[citation needed] Some parsing algorithms (such as Earley or GLR parsers) can generate...
grammar into a working parser. Strictly speaking, a generative grammar does not in any way correspond to the algorithm used to parse a language, and various...
an article called "Parsing as Deduction", describing things such as how the Earley Deduction proof procedure is used for parsing. Pereira also collaborated...
Global Information
