0

3.0kviews

For the following grammer construct LL(1) parser table

written 8.2 years ago by akshaydamodarmeher • 0

•   modified 8.0 years ago

S→F S→(S-F) F→a
And Parse the string (a-a). Show contents of stack and i/p buffer and action taken after each up.

need-tagging

ADD COMMENT FOLLOW SHARE EDIT

1 Answer

0

77views

written 8.0 years ago by akshaydamodarmeher • 0

In above production thire is no terminal symbol, So above grammar is not in the form of LL(1) grammer. So we can say that above grammar is not in LL(1)

ADD COMMENT SHARE EDIT