Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/47970
Title: Bounded-connect noncanonical discriminating-reverse parsers
Authors: Farré, Jacques
Fortes Gálvez, J. 
UNESCO Clasification: 1203 Ciencia de los ordenadores
Keywords: Conflict resolution
Discriminating-reverse
Noncanonical
Two stacks
Unbounded lookahead
Item graph
Issue Date: 2004
Journal: Theoretical Computer Science 
Conference: 6th International Conference on Implementation and Application of Automata (CIAA 2001) 
Abstract: 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
Source: Theoretical Computer Science [ISSN 0304-3975], v. 313 (1), p. 73-91
Appears in Collections:Actas de congresos
Show full item record

SCOPUSTM   
Citations

3
checked on Jul 12, 2020

WEB OF SCIENCETM
Citations

3
checked on Jul 12, 2020

Page view(s)

3
checked on Jul 11, 2020

Google ScholarTM

Check

Altmetric


Share



Export metadata



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