Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/72795
Title: Bounded-graph construction for noncanonical discriminating-reverse parsers
Authors: Farré, Jacques
Fortes Gálvez, José 
UNESCO Clasification: 1203 Ciencia de los ordenadores
Issue Date: 2002
Journal: Lecture Notes in Computer Science 
Conference: 6th International Conference on Implementation and Application of Automata, CIAA 2001 
Abstract: We present a new approach for the construction of NDR parsers, which defines a new form of items and keeps track of bounded sequences of subgraph connections. This improves the precise recovery of conflicts' right-hand contexts over the basic looping approach, and thus allows to extend the class of accepted grammars. Acceptance of at least all LALR(k) grammars, for a given k, is guaranteed. Moreover, the construction needs no subgraph copies. Since bounded-graph and basic looping constructions onlydi ffer in the accuracyo f the conflicts' right-hand contexts computation, the NDR parsing algorithm remains unchanged.
URI: http://hdl.handle.net/10553/72795
ISBN: 978-3-540-00400-4
ISSN: 0302-9743
DOI: 10.1007/3-540-36390-4_9
Source: Watson B.W., Wood D. (eds) Implementation and Application of Automata. CIAA 2001. Lecture Notes in Computer Science, [ISSN 0302-9743], vol 2494, p. 101-114. Springer, Berlin, Heidelberg, (Enero 2002)
Appears in Collections:Actas de congresos
Show full item record

SCOPUSTM   
Citations

2
checked on Jul 5, 2020

Page view(s)

10
checked on Jul 4, 2020

Google ScholarTM

Check

Altmetric


Share



Export metadata



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