483 Hits in 4.9 sec

On directly constructing LR(k) parsers without chain reductions

Wilf R. LaLonde
1976 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages - POPL '76  
In this paper, we present an algorithm for directly constructing LR(k) parsers with arbitrary subsets of the chain productions, called the useless chain productions, optimized out.  ...  Pager in [PagS] has presented an algorithm which removes all chain reductions from LR(1) parsers after they have been constructed.  ...  In this paper, we present a technique for directly constructing LR(k) parsers in such a way that reductions involving useless chain productions are eliminated.  ... 
doi:10.1145/800168.811546 dblp:conf/popl/LaLonde76 fatcat:sxypl5uxsfamxgoa4whhiamk7i

A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead

Joop M.I.M. Leo
1991 Theoretical Computer Science  
1) ;tLiiti A new general context-free parsing algorithm is pre<.ented which runs in linear time and space on every LR( k) grammar without using any lookahead and without making use of the LR property.  ...  ., A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead, Theoretical Computer Scic 2s; 82 :'13?  ...  To determine the topmost item on a deterministic reduction path we do not always have to construct the complete reduction path.  ... 
doi:10.1016/0304-3975(91)90180-a fatcat:mcikgsmte5dxhbojvzkdejp3eu

Page 1582 of Mathematical Reviews Vol. , Issue 80D [page]

1980 Mathematical Reviews  
Anton Nijholt (Amsterdam) Witaszek, Jacek 80d:68114 *Konstrukcja i optymalizacja analizatorow LR(k). (Polish) [Construction and optimization of LR(k) parsers} With Russian and English summaries.  ...  With this new definition of =, one can generalize the definition of LR(k) grammars to a definition of LR(k) RRP grammars. In an earlier paper by the author [Comm.  ... 

Generalised Parsing: Some Costs [chapter]

Adrian Johnstone, Elizabeth Scott, Giorgios Economopoulos
2004 Lecture Notes in Computer Science  
We also present results from our new Binary RNGLR algorithm which is asymptotically the fastest parser in this family and show that the recently reported reduction incorporated parsers can require automata  ...  that are too large to be practical on current machines.  ...  Knuth-style LR parsers (which may be using LR(k), SLR(k) or LALR(k) tables) are an attractive starting point for breadth first search because the entire parser configuration is encoded onto a stack of  ... 
doi:10.1007/978-3-540-24723-4_7 fatcat:5coet3nt4ne47fvbf6igfd6ah4

Recursion Engineering for Reduction Incorporated Parsers

Adrian Johnstone, Elizabeth Scott
2005 Electronical Notes in Theoretical Computer Science  
of RI automata using profiling information gathered from running parsers: in this way we propose to optimise our parsers' table size against performance on actual parsing tasks.  ...  Reduction Incorporated (RI) recognisers and parsers deliver high performance by suppressing the stack activity except for those rules that generate fully embedded recursion.  ...  The essential idea in both algorithms is to construct a parsing automaton which performs reductions directly where ever possible.  ... 
doi:10.1016/j.entcs.2005.02.060 fatcat:ho7kobk35ve4vax4thgspjpquq

Efficient and flexible incremental parsing

Tim A. Wagner, Susan L. Graham
1998 ACM Transactions on Programming Languages and Systems  
We present a simple algorithm based on parsing LR(k) sentential forms that can incrementally parse an arbitrary number of textual and/or structural modifications in optimal time and with no storage overhead  ...  trees directly.  ...  Special thanks go to John Boyland, Todd Feldman, William Maddox, Vance Maverick, and the anonymous reviewers for their comments on drafts of this article.  ... 
doi:10.1145/293677.293678 fatcat:rvo5tk5xurcj5jzd42oqvga55e

Automatic recursion engineering of reduction incorporated parsers

Adrian Johnstone, Elizabeth Scott
2007 Science of Computer Programming  
Reduction Incorporated (RI) parsers deliver high performance by suppressing the stack activity except for those rules that generate embedded recursion.  ...  Automaton constructions for RI parsing have been presented by ] but both can yield very large tables.  ...  The essential idea in both algorithms is to construct a parsing automaton which performs reductions directly where ever possible.  ... 
doi:10.1016/j.scico.2006.04.011 fatcat:4sz6b2k66bcydblea4g5pjckca

Practical arbitrary lookahead LR parsing

Manuel E. Bermudez, Karl M. Schimpf
1990 Journal of computer and system sciences (Print)  
When restricted to k-symbol lookahead, the technique has the power of LALR(k) parsers.  ...  We present a practical technique for computing lookahead for an LR(0) parser, that progressively attempts single-symbol, multi-symbol, and arbitrary lookahead.  ...  Case (i) -12 l-izG-l> if Direct Construction of Deterministic Lookahead Automata Here we outline the algorithm for constructing DLAA, directly, i.e., without the intermediate step of building NLAA,.  ... 
doi:10.1016/0022-0000(90)90037-l fatcat:tb56pidb35ctng742ifvyzuwzm

Evaluating GLR parsing algorithms

Adrian Johnstone, Elizabeth Scott, Giorgios Economopoulos
2006 Science of Computer Programming  
We give results showing the size of the structures constructed by these parsers and the amount of searching required during the parse, which abstracts their runtime.  ...  three types of LR table.  ...  An LR DFA is obtained by running the subset construction on one of these NFAs. An LALR DFA can be constructed from an LR(1) DFA using the la_merge function.  ... 
doi:10.1016/j.scico.2006.04.004 fatcat:eiqtzniwmvaahnnefzsajteb24

Parsing methods streamlined [article]

Luca Breveglieri, Stefano Crespi Reghizzi, Angelo Morzenti
2013 arXiv   pre-print
Since all the parsers operate on compatible representations, it is feasible to combine them into mixed mode algorithms.  ...  We present a simple general construction method for EBNF ELR(1) parsers, where the new category of convergence conflicts is added to the classical shift-reduce and reduce-reduce conflicts; we prove its  ...  (B) directly construct an ELR (1) parser from the given machine net.  ... 
arXiv:1309.7584v1 fatcat:5bzysnjx6fat5ne5peea2rm6ea

Disambiguation Filters for Scannerless Generalized LR Parsers [chapter]

Mark G. J. van den Brand, Jeroen Scheerder, Jurgen J. Vinju, Eelco Visser
2002 Lecture Notes in Computer Science  
Disambiguation constructs can be interpreted as filters on parse forests. Depending on the kind of disambiguation, filters can be applied at parser generation time, at parse time, or after parsing.  ...  Ambiguities that arise through the use of unrestricted grammars are handled by explicit disambiguation constructs, instead of implicit defaults that are taken by traditional scanner and parser generators  ...  Hayco de Jong and Pieter Olivier dedicated considerable time on improving SGLR efficiency.  ... 
doi:10.1007/3-540-45937-5_12 fatcat:vaexoipvy5ffldxi62glxdfbge

Generalized Bottom Up Parsers With Reduced Stack Activity

E. Scott
2005 Computer journal  
The automaton features edges which directly connnect states containing reduction actions with their associated goto state: hence we call the approach reduction incorporated generalized LR parsing.  ...  The Computer Journal Vol. 48 No. 5, 2005 S ::= aAbb | cAbd A ::= d is given below, with the corresponding LR(0) DFA obtained by using the subset construction on the FA.  ...  A move along an RCA reduction arrow corresponds to an LR DFA reduce action without the need for tracing back.  ... 
doi:10.1093/comjnl/bxh102 fatcat:fqykzkvi2zg3nj62hwwd37zszm

Extending lookahead for LR parsers

Theodore P. Baker
1981 Journal of computer and system sciences (Print)  
Instead, we choose to implement a reduce arc by a set of transitions on terminal symbols, corresponding to all the shift transitions on terminal symbols that may follow a chain of reductions.  ...  Since it is based on a state transition graph. rather than a grammar, there should not even be any difficulty applying the construction to LR parsers obtained from regular right-part grammars [ 111, or  ...  A recent paper by DeRemer [6] on efficient algorithms for computing LALR(1) lookahead sets makes use of state relationships very similar to those behind the XLR construction.  ... 
doi:10.1016/0022-0000(81)90030-1 fatcat:er67vowxo5cqjnshmqpayne7fy

SLR inference: An inference system for fixed-mode logic programs, based on SLR parsing

David A. Rosenblueth, Julio C. Peralta
1998 The Journal of Logic Programming  
We have selected an SLR parser as the basis for our inference system because such a parser illustrates various aspects of LR parsing without being so elaborate as to obscure the presentation of our method  ...  Parsers for context-free grammars that use backtracking, for instance, were soon replaced by more efficient methods, such as LR parsers.  ...  We based our exposition on an SLR parser [2] . We believe, however, that variations around LR parsing, such as LALR, LR(k), and even Tomita's parser [33] , could be used alternatively.  ... 
doi:10.1016/s0743-1066(96)00076-3 fatcat:7nl6zwzbovexzlxiuvsqe77tay

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

Bryan Ford
2006 arXiv   pre-print
Any language defined by an LL(k) or LR(k) grammar can be recognized by a packrat parser, in addition to many languages that conventional linear-time algorithms do not support.  ...  This paper describes packrat parsing informally with emphasis on its use in practical applications, and explores its advantages and disadvantages with respect to the more conventional alternatives.  ...  A packrat parser can easily be constructed for any language described by an LL(k) or LR(k) grammar, as well as for many languages that require unlimited lookahead and therefore are not LR.  ... 
arXiv:cs/0603077v1 fatcat:flk3jeqayfeixcr6eb7nomwcui
« Previous Showing results 1 — 15 out of 483 results