Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/a-new-top-down-parsing-algorithm-to-accommodate-ambiguity-and-left-j480xgMs2h
References (19)
-
(2006)
Using monads to accommodate ambiguity and left recursion with parser combinators -
P. Koopman, M. Plasmeijer (1998)
Efficient Combinator Parsers -
(2006)
ACM SIGPLAN Notices -
R. Frost (2003)
Monadic Memoization towards Correctness-Preserving Reduction of Search -
Bryan Ford (2002)
Packrat parsing:: simple, powerful, lazy, linear time, functional pearlArXiv, abs/cs/0603077
-
(1993)
Top-Down Parsing for Left-recursive Grammars -
S. Kuno (1965)
The predictive analyzer and a path elimination techniqueCommun. ACM, 8
-
Mark Johnson (1995)
Squibs and Discussions: Memoization in Top-Down ParsingComput. Linguistics, 21
-
G. Hutton (1992)
Higher-order functions for parsingJournal of Functional Programming, 2
-
K. Koskimies (1990)
Lazy recursive descent parsing for modular language implementationSoftware: Practice and Experience, 20
-
Mark Johnson (1995)
SQUIBS AND DISCUSSIONS : MEMORIZATION IN TOP-DOWN PARSINGThe Association for Computational Linguistics, 21
-
R. Frost (1993)
Guarded attribute grammarsSoftware: Practice and Experience, 23
-
Peter Norvig (1991)
Techniques for Automatic Memoization with Applications to Context-Free Parsing -
Carlos Camarão, Lucília Figueiredo, Hermann Rodrigues (2003)
Mimico: a Monad Combinator Parser GeneratorJ. Braz. Comput. Soc., 9
-
M. Tomita (1985)
Efficient parsing for natural language -
R. Leermakers (1993)
The Functional Treatment of Parsing -
Carlos Camarão, Lucília Figueiredo (2001)
Mimico: A Monadic Combinator Compiler GeneratorJournal of the Brazilian Computer Society
-
M. Tomita (1985)
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems -
(1995)
Parsing With Fixed Points
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2006 by ACM Inc.
- ISSN
- 0362-1340
- DOI
- 10.1145/1149982.1149988
- Publisher site
- See Article on Publisher Site
Abstract
Top-down backtracking language processors are highly modular, can handle ambiguity, and are easy to implement with clear and maintainable code. However, a widely-held, and incorrect, view is that top-down processors are inherently exponential for ambiguous grammars and cannot accommodate left-recursive productions. It has been known for many years that exponential complexity can be avoided by memoization, and that left-recursive productions can be accommodated through a variety of techniques. However, until now, memoization and techniques for handling left recursion have either been presented independently, or else attempts at their integration have compromised modularity and clarity of the code.
Journal
ACM SIGPLAN Notices – Association for Computing Machinery
Published: May 1, 2006