Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/47971
Title: Generating LR(1) parsers of small size
Authors: Fortes Gálvez, José 
UNESCO Clasification: 1203 Ciencia de los ordenadores
Issue Date: 1992
Journal: Lecture Notes in Computer Science 
Conference: 4TH INTERNATIONAL WORKSHOP ON COMPILER CONSTRUCTION ( CC 92 ) 
Abstract: Classic LR(1) parsing methods have the problem of producing too large parsing tables for programming language grammars. An alternative is to build an automaton that combines the lookahead symbol with reading the parsing stack from its top, to determine the next parsing action. The building procedure for such a parser and its use for parsing are presented through an example grammar. Results from an experimental implementation of the parser generator show important reductions in automaton size in comparison with standard LR methods. Some discussion is presented, suggesting that the theoretical drawbacks of the method are of relatively little practical importance.
URI: http://hdl.handle.net/10553/47971
ISBN: 978-3-540-55984-9
ISSN: 0302-9743
DOI: 10.1007/3-540-55984-1_2
Source: Kastens U., Pfahler P. (eds) Compiler Construction. CC 1992. Lecture Notes in Computer Science, vol 641. Springer, Berlin, Heidelberg
Appears in Collections:Actas de congresos
Thumbnail
pdf
Adobe PDF (722,84 kB)
Show full item record

SCOPUSTM   
Citations

5
checked on Jul 12, 2020

WEB OF SCIENCETM
Citations

4
checked on Jul 12, 2020

Page view(s)

18
checked on Jul 11, 2020

Download(s)

100
checked on Jul 11, 2020

Google ScholarTM

Check

Altmetric


Share



Export metadata



Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.