Ambiguity for subsets of CFL?

Soren Dayton <csdayton+usenet@cs.uchicago.edu>
12 May 1998 22:27:52 -0400

          From comp.compilers
Related articles
Ambiguity for subsets of CFL? csdayton+usenet@cs.uchicago.edu (Soren Dayton) (1998-05-12)
Re: Ambiguity for subsets of CFL? torbenm@diku.dk (Torben Mogensen) (1998-05-15)
| List of all articles for this month |
From: Soren Dayton <csdayton+usenet@cs.uchicago.edu>
Newsgroups: comp.compilers,comp.theory
Date: 12 May 1998 22:27:52 -0400
Organization: University of Chicago
Distribution: inet
Keywords: parse, question, theory

Hello


I was wondering if there were any results (and then implementations)
that given:


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?


Thanks
Soren Dayton
--

Post a followup to this message

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