For the following grammer construct LL(1) parser table

2.7kviews

written 6.4 years ago by

rajyadav.engg • 480

• modified 6.2 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 EDIT

1 Answer

70views

written 6.2 years ago by

rajyadav.engg • 480

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)

Create a free account to keep reading this post.

and 3 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.