compiler with non-deterministic grammar

Wei-cheng Lai <wlai@mail.utexas.edu>
3 May 1997 00:53:20 -0400

          From comp.compilers
Related articles
compiler with non-deterministic grammar wlai@mail.utexas.edu (Wei-cheng Lai) (1997-05-03)
Re: compiler with non-deterministic grammar thetick@scruz.net (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.dutta@mpct.com (Sandeep Dutta) (1997-05-15)
Re: compiler with non-deterministic grammar adrian@dcs.rhbnc.ac.uk (1997-05-17)
| List of all articles for this month |
From: Wei-cheng Lai <wlai@mail.utexas.edu>
Newsgroups: comp.compilers
Date: 3 May 1997 00:53:20 -0400
Organization: The University of Texas at Austin, Austin, Texas
Keywords: parse, question

Hi,


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?


Thanks


Wei-Cheng Lai
[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]




--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.