Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Seite:1987:YEL,
author = "B. Seite",
title = "A {Yacc} extension for {LRR} grammar parsing",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "1--2",
pages = "91--143",
month = "????",
year = "1987",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Cohen-Culik LRR; complementary tables; conflicting
actions; deterministic bottom-up parsing; finite
automata; finite-state automata generation; grammars;
linear-time parsing; lookahead; LR automata; LR0
collection; LRR grammar parsing; stack; unbounded
examination; Yacc extension",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}