Identificador persistente para citar o vincular este elemento: http://hdl.handle.net/10553/72930
Título: A bounded graph-connect construction for LR-regular parsers
Autores/as: Farré, Jacques
Fortes Gálvez, José 
Clasificación UNESCO: 120323 Lenguajes de programación
1203 Ciencia de los ordenadores
Fecha de publicación: 2001
Publicación seriada: Lecture Notes in Computer Science 
Conferencia: 10th International Conference on Compiler Construction, CC 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 
Resumen: Parser generation tools currently used for computer language analysis rely on user wisdom in order to resolve grammar conflicts. Here practical LR(0)-based parser generation is introduced, with automatic conflict resolution by potentially-unbounded lookahead exploration. The underlying LR(0)-automaton item dependence graph is used for lookahead DFA construction. A bounded graph-connect technique overcomes the difficulties of previous approaches with empty rules, and compact coding allows to precisely resume right-hand contexts. Resulting parsers are deterministic and linear, and accept a large class of LR-regular grammars including LALR(fc). Their construction is formally introduced, shown to be decidable, and illustrated by a detailed example.
URI: http://hdl.handle.net/10553/72930
ISBN: 978-3-540-41861-0
ISSN: 0302-9743
DOI: 10.1007/3-540-45306-7_17
Fuente: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) [ISSN 0302-9743], v. 2027, p. 244-258, (Enero 2001)
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.