Identificador persistente para citar o vincular este elemento:
http://hdl.handle.net/10553/47970
| Título: | Bounded-connect noncanonical discriminating-reverse parsers | Autores/as: | Farré, Jacques Fortes Gálvez, J. |
Clasificación UNESCO: | 1203 Ciencia de los ordenadores | Palabras clave: | Conflict resolution Discriminating-reverse Noncanonical Two stacks Unbounded lookahead, et al. |
Fecha de publicación: | 2004 | Publicación seriada: | Theoretical Computer Science | Conferencia: | 6th International Conference on Implementation and Application of Automata (CIAA 2001) | Resumen: | The precision of right-hand context covering for conflict resolution is improved over previous NDR parsers, resulting in acceptation of wider subsets of LR-regular and LR-nonregular grammars, including all LALR(k) grammars for a given k. Parser generation combines a new form of DR items and subgraph connections of bounded length, without the need to implement subgraph copies. The NDR parser, whose algorithm remains essentially unchanged, is presented as an extended two-stack pushdown automaton. The technique is illustrated with a detailed example. | URI: | http://hdl.handle.net/10553/47970 | ISSN: | 0304-3975 | DOI: | 10.1016/j.tcs.2003.10.006 | Fuente: | Theoretical Computer Science [ISSN 0304-3975], v. 313 (1), p. 73-91 |
| Colección: | Actas de congresos |
Los elementos en ULPGC accedaCRIS están protegidos por derechos de autor con todos los derechos reservados, a menos que se indique lo contrario.