|Can unambiguous grammars be parsed in linear time? firstname.lastname@example.org (1991-04-05)|
|From:||email@example.com (M.J. Nederhof)|
|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:
Return to the
Search the comp.compilers archives again.