Name
Abstract | ||
|---|---|---|
A family of parsing algorithms for general context-free grammars is described. Its members have a top-down structure, while performing tests similar to those introduced in both LR and LL algorithms. A theoretical study shows that the algorithms have the same time and space bounds as Earley's algorithms, which are particular members of the family. Empirical comparisons show the effectiveness of the new members of the family, which appear to be definitely better than Earley's algorithms, except for a few pathological grammars. |
Year | DOI | Venue |
|---|---|---|
1975 | 10.1016/0020-0255(75)90002-X | Information Sciences |
Field | DocType | Volume |
Rule-based machine translation,Programming language,S-attributed grammar,Computer science,Spacetime,Algorithm,Theoretical computer science,Definitely Better,Parsing expression grammar,Parsing | Journal | 8 |
Issue | ISSN | Citations |
1 | 0020-0255 | 10 |
PageRank | References | Authors |
2.88 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Bouckaert | 1 | 12 | 3.81 |
| Alain Pirotte | 2 | 916 | 260.52 |
| M. Snelling | 3 | 10 | 2.88 |