|compiler with non-deterministic grammar email@example.com (Wei-cheng Lai) (1997-05-03)|
|Re: compiler with non-deterministic grammar firstname.lastname@example.org (Scott Stanchfield) (1997-05-08)|
|Re: compiler with non-deterministic grammar eserra@svmp01.Harris.COM (Efren Serra) (1997-05-13)|
|Re: compiler with non-deterministic grammar Sandeep.email@example.com (Sandeep Dutta) (1997-05-15)|
|Re: compiler with non-deterministic grammar firstname.lastname@example.org (1997-05-17)|
|From:||Efren Serra <eserra@svmp01.Harris.COM>|
|Date:||13 May 1997 22:51:45 -0400|
|Organization:||Harris Electronic System Sector|
|Keywords:||parse, books, comment|
3 May 1997, Wei-cheng Lai wrote:
> Does anybody know how to construct a compiler with
> non-deterministic grammar? I means that the grammars may contain some
> probability within it. The same sentence might be compiled in
> different way based on some sort of probability. Could you also tell
> me what are good references?
The compiler bible is by Aho, Hopcroft, and Ullman and it is titled
Compilers - Principles, Techniques and Tools. There is no substitude.
[But I don't recall it saying anything on this particular topic. -John]
Return to the
Search the comp.compilers archives again.