Identificador persistente para citar o vincular este elemento: http://hdl.handle.net/10553/72795
Título: Bounded-graph construction for noncanonical discriminating-reverse parsers
Autores/as: Farré, Jacques
Fortes Gálvez, José 
Clasificación UNESCO: 1203 Ciencia de los ordenadores
Fecha de publicación: 2002
Publicación seriada: Lecture Notes in Computer Science 
Conferencia: 6th International Conference on Implementation and Application of Automata, CIAA 2001 
Resumen: 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
Fuente: 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)
Colección:Actas de congresos
Vista completa

Google ScholarTM

Verifica

Altmetric


Comparte



Exporta metadatos



Los elementos en ULPGC accedaCRIS están protegidos por derechos de autor con todos los derechos reservados, a menos que se indique lo contrario.