A new approach to Earley's parsing algorithm (Q1823714)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4116006
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new approach to Earley's parsing algorithm |
scientific article; zbMATH DE number 4116006 |
Statements
A new approach to Earley's parsing algorithm (English)
0 references
1989
0 references
The paper presents an algorithm for parsing general context-free languages equivalent to that of Earley - see \textit{J. Earley} [An efficient context-free parsing algorithm, Commun. ACM 13, 94-102 (1970; Zbl 0185.434)]. Starting from the Earley algorithm presented in S. L. Graham and \textit{M. A. Harrison} [Parsing of general context-free grammars, in: M. Rubinoff and M. Yovits, Eds., Advances in Computers 14 (1976)] the author gives an algorithm that is more efficient both in time and in space than the original one.
0 references
Earley parsing algorithm
0 references
context-free languages
0 references
0.8854613900184631
0 references
0.844725489616394
0 references
