|Ambiguity for subsets of CFL? email@example.com (Soren Dayton) (1998-05-12)|
|Re: Ambiguity for subsets of CFL? firstname.lastname@example.org (Torben Mogensen) (1998-05-15)|
|From:||Soren Dayton <email@example.com>|
|Date:||12 May 1998 22:27:52 -0400|
|Organization:||University of Chicago|
|Keywords:||parse, question, theory|
I was wondering if there were any results (and then implementations)
some C a subset of CFL that includes the regular languages and
some grammar G with suitable restrictions and L(G) in C,
tells us whether or not G is ambiguous?
That is, are there restrictions on C and the structure of G such that
the question of G's ambiguity is decidable?
And then, assuming that there are theorems of relevance to the question,
are there any free and implemented parsers for grammars like these?
Return to the
Search the comp.compilers archives again.