Name
Abstract | ||
|---|---|---|
Deterministic parsing techniques are typically used in favor of general parsing algorithms for efficiency reasons. However, general algorithms such as Earley's method are more powerful and also easier for developers to use, because no seemingly arbitrary restrictions are placed on the grammar. We describe how to narrow the performance gap between general and deterministic parsers, constructing a directly-executable Earley parser that can reach speeds comparable to deterministic methods even on grammars for commonly-used programming languages. |
Year | Venue | Keywords |
|---|---|---|
2001 | CC | deterministic parsers,general parsing algorithm,deterministic parsing technique,efficiency reason,arbitrary restriction,general algorithm,performance gap,commonly-used programming language,directly-executable earley parsing,directly-executable earley parser,generic algorithm |
Field | DocType | ISBN |
Top-down parsing,Deterministic parsing,LR parser,Programming language,S-attributed grammar,Computer science,Bottom-up parsing,Parsing expression grammar,Parser combinator,Earley parser | Conference | 3-540-41861-X |
Citations | PageRank | References |
7 | 0.83 | 17 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Aycock | 1 | 351 | 33.03 |
| R. Nigel Horspool | 2 | 643 | 115.14 |