Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/72738
Title: Shift-resolve parsing: simple, unbounded lookahead, linear time
Authors: Fortes Gálvez, José 
Schmitz, Sylvain
Farre, Jacques
UNESCO Clasification: 1203 Ciencia de los ordenadores
120323 Lenguajes de programación
Keywords: Shift-resolve
Noncanonical parser
Regular lookahead
Twostack pushdown automaton
Position graph
Issue Date: 2006
Journal: Lecture Notes in Computer Science 
Conference: 11th International Conference on Implementation and Application of Automata, CIAA 2006 
Abstract: This paper introduces a mechanism for combining unbounded lookahead exploration with linear time complexity in a deterministic parser. The idea is to use a resolve parsing action in place of the classical reduce. The construction of shift-resolve parsers is presented as a two-step algorithm, from the grammar to a finite nondeterministic automaton, and from this automaton to the deterministic parser. Grammar classes comparisons are provided.
URI: http://hdl.handle.net/10553/72738
ISBN: 3-540-37213-X
ISSN: 0302-9743
DOI: 10.1007/11812128_24
Source: Implementation And Application Of Automata [ISSN 0302-9743], v. 4094, p. 253-264, (2006)
Appears in Collections:Actas de congresos
Thumbnail
PDF
Adobe PDF (212,51 kB)
Show full item record

SCOPUSTM   
Citations

3
checked on Jan 24, 2021

WEB OF SCIENCETM
Citations

5
checked on Jan 24, 2021

Page view(s)

45
checked on Jan 25, 2021

Download(s)

23
checked on Jan 25, 2021

Google ScholarTM

Check

Altmetric


Share



Export metadata



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