Need help with Programming Language plz. (15) Consider this grammar and given table: S -(L) L-L,S L-S rocess the string (a, (a, a)) using the table and showing the steps for processing ach input....
1.Use the action/goto table for the grammar below (where the productions are as numbered) to parse the incorrect input string: ( 2 ( ) ) 5 ) 6 ) When the syntax error is detected, a) what does the stack look like, b) what was the last action and c) what is the lookahead? 1: R->S 2.S->(L)L 3.S-> ε 4.L->int L 5. L->S state ( ) int $ S L 0 s2 r3 r3 1 1 acc 2 s2...