Filters








1,207 Hits in 6.6 sec

Modular and efficient top-down parsing for ambiguous left-recursive grammars

Richard A. Frost, Rahmatullah Hafiz, Paul C. Callaghan
2007 Proceedings of the 10th International Conference on Parsing Technologies - IWPT '07   unpublished
Commonly used implementations are inefficient for ambiguous languages, cannot accommodate left-recursive grammars, and require exponential space to represent parse trees for highly ambiguous input.  ...  These techniques are based on top-down backtracking search.  ...  Acknowledgements Richard Frost acknowledges the support provided by the Natural Sciences and Engineering Research Council of Canada in the form of a discovery grant.  ... 
doi:10.3115/1621410.1621425 fatcat:6wyt54zpkbdwhh5qub3dn5nwoe

Executable Specifications of Fully General Attribute Grammars with Ambiguity and Left-Recursion [chapter]

Rahmatullah Hafiz
2009 Lecture Notes in Computer Science  
A top-down parsing algorithm has been constructed to accommodate any form of ambiguous context-free grammar, augmented with semantic rules with arbitrary attribute dependencies.  ...  A memoization technique is used with this non-strict method for efficiently processing ambiguous input.  ...  Basic top-down parsers do not terminate while processing left-recursion, and are normally inefficient while parsing exponentially ambiguous grammars (e.g., S ::= SSa| , on input "aaa...." [1] ).  ... 
doi:10.1007/978-3-642-01818-3_41 fatcat:57yekqmfgvei3bl5wg6qam2dve

A new top-down parsing algorithm to accommodate ambiguity and left recursion in polynomial time

Richard A. Frost, Rahmatullah Hafiz
2006 SIGPLAN notices  
However, a widely-held, and incorrect, view is that top-down processors are inherently exponential for ambiguous grammars and cannot accommodate left-recursive productions.  ...  Top-down backtracking language processors are highly modular, can handle ambiguity, and are easy to implement with clear and maintainable code.  ...  Overview The goal of this research is to develop a method by which top-down parsers can accommodate ambiguity and left recursive grammars and be efficient enough for prototyping natural-language processors  ... 
doi:10.1145/1149982.1149988 fatcat:mqycdu7pnjbbjg7petiith6aue

Guarded attribute grammars

R. A. Frost
1993 Software, Practice & Experience  
The use of a topdown parsing strategy increases modularity and the use of left-recursive productions facilitates specification of semantic equations.  ...  of grammars containing left-recursive productions.  ...  The use of a top-down parsing strategy increases modularity and the use of left-recursive productions facilitates specification of semantic equations.  ... 
doi:10.1002/spe.4380231006 fatcat:wvekcvwh7fcgllyjbnp6mq776a

Guarded attribute grammars

Richard A. Frost
1992 SIGPLAN notices  
The use of a topdown parsing strategy increases modularity and the use of left-recursive productions facilitates specification of semantic equations.  ...  of grammars containing left-recursive productions.  ...  The use of a top-down parsing strategy increases modularity and the use of left-recursive productions facilitates specification of semantic equations.  ... 
doi:10.1145/130981.130990 fatcat:vmnqcjrr2jdidcdj3le4iuur2m

Towards Zero-Overhead Disambiguation of Deep Priority Conflicts

Luís Eduardo de Souza Amorim, Michael J. Steindorfer, Eelco Visser
2018 The Art, Science, and Engineering of Programming  
However, there is no solution in the literature that addresses efficient disambiguation of deep priority conflicts, with support for modular and composable syntax definitions.  ...  However, the natural and concise way of writing a context-free grammar is often ambiguous.  ...  We would also like to thank Jasper Denkers for his work on JSGLR , and Peter Mosses and the anonymous reviewers for their detailed feedback.  ... 
doi:10.22152/programming-journal.org/2018/2/13 fatcat:iilbslbbwjdrhhtqgcagyhifui

Adaptive LL(*) parsing

Terence Parr, Sam Harwell, Kathleen Fisher
2014 Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications - OOPSLA '14  
This paper introduces the ALL(*) parsing strategy that combines the simplicity, efficiency, and predictability of conventional top-down LL(k) parsers with the power of a GLR-like mechanism to make parsing  ...  ANTLR 4 generates ALL(*) parsers and supports direct left-recursion through grammar rewriting.  ...  Acknowledgments We thank Elizabeth Scott, Adrian Johnstone, and Mark Johnson for discussions on parsing algorithm complexity.  ... 
doi:10.1145/2660193.2660202 dblp:conf/oopsla/ParrHF14 fatcat:qst6nncejvbcjbk7bjopzltfx4

Adaptive LL(*) parsing

Terence Parr, Sam Harwell, Kathleen Fisher
2014 SIGPLAN notices  
This paper introduces the ALL(*) parsing strategy that combines the simplicity, efficiency, and predictability of conventional top-down LL(k) parsers with the power of a GLR-like mechanism to make parsing  ...  ANTLR 4 generates ALL(*) parsers and supports direct left-recursion through grammar rewriting.  ...  Acknowledgments We thank Elizabeth Scott, Adrian Johnstone, and Mark Johnson for discussions on parsing algorithm complexity.  ... 
doi:10.1145/2714064.2660202 fatcat:vgnx37nbtnejzbvqeit55daiaq

Parsing of Kumauni Language Sentences after Modifying Earley's Algorithm [chapter]

Rakesh Pandey, Nihar Ranjan Pande, H. S. Dhami
2011 Communications in Computer and Information Science  
For this purpose, we have taken a set of pre-existing Kumauni sentences and derived rules of grammar from them.  ...  This mathematical model can be used for the purpose of parsing new Kumauni sentences, thus providing researchers a new parsing tool.  ...  Frost et al. (2007) presented a method by which parsers can be built as modular and efficient executable specifications of ambiguous grammars containing unconstrained left recursion.  ... 
doi:10.1007/978-3-642-19403-0_26 fatcat:pbdcecyorzhqnkug2eze6uqfya

Robust Probabilistic Predictive Syntactic Processing [article]

Brian Roark
2001 arXiv   pre-print
This thesis presents a broad-coverage probabilistic top-down parser, and its application to the problem of language modeling for speech recognition.  ...  The basic parser and conditional probability models are presented, and empirical results are provided for its parsing accuracy on both newspaper text and spontaneous telephone conversations.  ...  This difficulty with left-recursion is one of the major criticisms of top-down parsing, and one of the large benefits of left-corner and bottom-up parsing over top-down.  ... 
arXiv:cs/0105019v1 fatcat:2hh2zt43drazfnpef2m43e6ica

Packrat Parsing: Simple, Powerful, Lazy, Linear Time [article]

Bryan Ford
2006 arXiv   pre-print
A packrat parser provides the power and flexibility of top-down parsing with backtracking and unlimited lookahead, but nevertheless guarantees linear parse time.  ...  Yet despite its power, packrat parsing shares the same simplicity and elegance as recursive descent parsing; in fact converting a backtracking recursive descent parser into a linear-time packrat parser  ...  Acknowledgments I wish to thank my advisor Frans Kaashoek, my colleagues Chuck Blake and Russ Cox, and the anonymous reviewers for many helpful comments and suggestions.  ... 
arXiv:cs/0603077v1 fatcat:flk3jeqayfeixcr6eb7nomwcui

Packrat parsing:

Bryan Ford
2002 SIGPLAN notices  
A packrat parser provides the power and flexibility of top-down parsing with backtracking and unlimited lookahead, but nevertheless guarantees linear parse time.  ...  Yet despite its power, packrat parsing shares the same simplicity and elegance as recursive descent parsing; in fact converting a backtracking recursive descent parser into a linear-time packrat parser  ...  Acknowledgments I wish to thank my advisor Frans Kaashoek, my colleagues Chuck Blake and Russ Cox, and the anonymous reviewers for many helpful comments and suggestions.  ... 
doi:10.1145/583852.581483 fatcat:xs2pkw6x6fg53hmmolxnmpocau

Packrat parsing:

Bryan Ford
2002 Proceedings of the seventh ACM SIGPLAN international conference on Functional programming - ICFP '02  
A packrat parser provides the power and flexibility of top-down parsing with backtracking and unlimited lookahead, but nevertheless guarantees linear parse time.  ...  Yet despite its power, packrat parsing shares the same simplicity and elegance as recursive descent parsing; in fact converting a backtracking recursive descent parser into a linear-time packrat parser  ...  Acknowledgments I wish to thank my advisor Frans Kaashoek, my colleagues Chuck Blake and Russ Cox, and the anonymous reviewers for many helpful comments and suggestions.  ... 
doi:10.1145/581478.581483 dblp:conf/icfp/Ford02 fatcat:ocrwbtlsyjfzbiqqoji3lf5mxm

Staged parser combinators for efficient data processing

Manohar Jonnalagedda, Thierry Coppey, Sandro Stucki, Tiark Rompf, Martin Odersky
2014 SIGPLAN notices  
Our approach applies to top-down recursive-descent parsers as well as bottom-up nondeterministic parsers with key applications in dynamic programming on sequences, where we auto-generate code for parallel  ...  Parsers are ubiquitous in computing, and many applications depend on their performance for decoding data efficiently.  ...  Acknowledgments We thank members of the LAMP team at EPFL for many fruitful discussions and insightful suggestions.  ... 
doi:10.1145/2714064.2660241 fatcat:mnjmyqojmrf57b3q5ze525jtk4

Staged parser combinators for efficient data processing

Manohar Jonnalagedda, Thierry Coppey, Sandro Stucki, Tiark Rompf, Martin Odersky
2014 Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications - OOPSLA '14  
Our approach applies to top-down recursive-descent parsers as well as bottom-up nondeterministic parsers with key applications in dynamic programming on sequences, where we auto-generate code for parallel  ...  Parsers are ubiquitous in computing, and many applications depend on their performance for decoding data efficiently.  ...  Acknowledgments We thank members of the LAMP team at EPFL for many fruitful discussions and insightful suggestions.  ... 
doi:10.1145/2660193.2660241 dblp:conf/oopsla/JonnalageddaCSRO14 fatcat:lpq3peudivdmtkzrqmfpx4ox7e
« Previous Showing results 1 — 15 out of 1,207 results