See this document in CiteSeerX!

Unifying LL and LR parsing (1993)  (Make Corrections)  
Wim Pijls



  Home/Search   Context   Related

 
View or download:
cs.few.eur.nl/pub/d...eur.cs.93.01.ps.Z
cs.few.eur.nl/pub/doc/webdo...report.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  fermivista.math...p.cs.few.eur.nl (more)
From:  fermivista.math...p.cs.few.eur.nl
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In parsing theory, LL parsing and LR parsing are regarded to be two distinct methods. In this paper the relation between these methods is clarified. As shown in literature on parsing theory, for every context-free grammar, a so-called non-deterministic LR(0) automaton can be constructed. Here, we show, that traversing this automaton in a special way is equivalent to LL(1) parsing. This automaton can be transformed into a deterministic LR-automaton. The description of a method to traverse this... (Update)

Similar documents (at the sentence level):
59.6%:   Unifying LL and LR parsing - Pijls (1993)   (Correct)

Active bibliography (related documents):   More   All
1.0:   LR, LC and LL parsing, some new points of view - Pijls   (Correct)
0.3:   Enforcing Strict Model-View Separation in Template Engines - Parr (2004)   (Correct)
0.3:   Error Recovery in Parsing Relational Languages - Tuovinen (1998)   (Correct)

Similar documents based on text:   More   All
0.2:   Adaptive Extensions of the Nelder and Mead Simplex Method.. - Neddermeijer, al. (2000)   (Correct)
0.2:   The STrawberry Growth Underneath The Nettle: The Emergence of . . .. - Krug, al. (2000)   (Correct)
0.2:   The Effectiveness of Different Mechanisms for Integrating.. - Leenders, al. (2001)   (Correct)

BibTeX entry:   (Update)

@misc{ pijls-unifying,
  author = "Wim Pijls",
  title = "Unifying {LL} and {LR} parsing",
  url = "citeseer.ist.psu.edu/2222.html" }
Citations (may not include all citations):
866   Techniques and Tools (context) - Aho, Sethi et al. - 1986
192   An efficient context-free parsing algorithm (context) - Earley - 1970
128   Efficient Parsing for Natural Language (context) - Tomita - 1986
12   Compiler Design in C (context) - Holub
4   Parsing Techniques (context) - Grune, Jacobs - 1990
4   Information Processing Letters (context) - Aretz, ascent - 1988
3   Soisalon-Soininen (context) - Sippu - 1990
2   Theoretical Computer Science (context) - Leermakers, Augusteijn et al. - 1992
2   Theoretical Computer Science (context) - Leermakers, parsing et al. - 1992
2   An LR Analog to Recursive Descent (context) - Roberts, Ascent - 1988
1   Cross-Fertilization of Earley Tomita (context) - Sikkel - 1990
1   Very Fast LR Parsing (context) - Penello - 1986

Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.few.eur.nl.html):   More
Towards a Proof of the Kahn Principle for Linear Dynamic.. - de Bruin, Nienhuys-Cheng (1994)   (Correct)
A Theory of Game Trees, Based on Solution Trees - Pijls, de Bruin (1996)   (Correct)
Constructing Refinement Operators by Decomposing.. - Nienhuys-Cheng.. (1995)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC