Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Leermakers:1992:FLP,
author = "R. Leermakers and L. Augusteijn and F. E. J. {Kruseman
Aretz}",
title = "A functional {LR} parser",
journal = j-THEOR-COMP-SCI,
volume = "104",
number = "2",
pages = "313--323",
day = "12",
month = oct,
year = "1992",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Philips Res. Labs., Eindhoven, Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; correctness proof; grammars;
LR(0) grammars; LR(0) parsers; memo-functions;
recursive ascent parsers; time complexity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}