Re: Grammars for LL(1) grammars?

  Lasse Hillerøe Petersen <lhp+news@toft-hp.dk> wrote:


In the meantime I have been reading on van Wijngaarden grammars; and
although (or because) my head is hurting a lot from this, *another*
thought has occured to me.
It seems that a vW grammar is as powerful as a Turing machine. Further,
it is decidable whether a CFG is LL(1).


My third question is: Is it possible to write a vW-grammar that would
accept (produce?) only CFGs that are LL(1)? And if yes, has anybody done
so?


(In case my previous post has been ignored on the assumption that I am
fishing for help in doing homework, I will say that I am just an amateur
asking out of pure curiosity. In fact I post my questions here precisely
because I have no professor or tutor to ask.)


-Lasse

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