|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:||Wei-cheng Lai <email@example.com>|
|Date:||3 May 1997 00:53:20 -0400|
|Organization:||The University of Texas at Austin, Austin, Texas|
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?
BTW, is it too wierd to have some kind of adaptive compiler such that
it can modify its grammar along the way?
[I'd look at some of the work done in linguistics, particularly
transformational grammars, where they valiantly tried to parse natural
languages using various hacks on context-free grammars. -John]
Return to the
Search the comp.compilers archives again.