Related articles |
---|
Can unambiguous grammars be parsed in linear time? markjan@cs.kun.nl (1991-04-05) |
Newsgroups: | comp.theory,comp.compilers |
From: | markjan@cs.kun.nl (M.J. Nederhof) |
Keywords: | parse, theory |
Organization: | University of Nijmegen, The Netherlands |
Date: | 5 Apr 91 14:23:53 GMT |
We have heard about a theorem which states that unambiguous grammars
can be parsed in linear time.
Does anybody know where this result has been published?
If you have a reference, please send it to:
janos@cs.kun.nl
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.