In: Computer Science
Write a pareser for the following grammar:
<vardecl> ::= var <vardecllist> ; <vardecllist> ::= <varandtype> { ; <varandtype> } <varandtype> ::= <ident> { , <ident> } : <typespec> <ident> ::= <letter> { <idchar> } <idchar> ::= <letter> | <digit> | _
Construction Predictive LL(1)
STEP 1) First() , Follow()
STEP 2)Parsing table
STEP 3)Stack implementation
STEP 4)Parse the i/p string
Finding first and follow
first is a set of terminal symbol that thing in string derived from grammer
First(A) = {a,d,g}
and also find left recursion