Last update: Thu Sep 27 02:46:39 MDT 2018
@Article{Olshansky:1977:DAC,
author = "T. Olshansky and A. Pnueli",
title = "A direct algorithm for checking equivalence of {LL(k})
grammars",
journal = j-THEOR-COMP-SCI,
volume = "4",
number = "3",
pages = "321--349",
month = jun,
year = "1977",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1975.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Computer Sci. Div., Tel Aviv Univ., Tel Aviv, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "branching; checking equivalence; computability and
decidability; decidable; direct algorithm; grammars;
LL(k) grammars",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}