(SYNTACTICAL ANALYZER --PARSER) Consider the Grammar: E E + T E E T | T T T * F T T / F | F F id F digit Note: Just consider id as id (terminal) Digit 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 You have to implement LL (1) parser using LL (1) parser table for above mentioned CFG (NonRecursive Predictive Parser.) Input: For Example 3+5*8; output: valid expression (3*7)+2; output: valid expression ((3*7) +2; output: Syntax error Note: Use ; as input end marker or instruction end symbol. You can also show the stack contents step by step. For example: Stack E $ TE $ FTE $ .. $(stack empty) Output: Valid /invalid expression (syntax error) NOTES: Input /Output Window Example Screenshot:

CFG : Syntax Parser Using LLC1) Developed By Mr. XYZ (Roll no. 123-Arid-123) E-> ET E -> E T IT T -> TF T -> TFF F-> id id -> X F -> digit digit -> 811 12 13 14 15 16 17 18 19 Input String And Press "ENTER" CFG : Syntax Parser Using LLC1) Developed By Mr. XYZ (Roll no. 123-Arid-123) E-> ET E -> E T IT T -> TF T -> TFF F-> id id -> X F -> digit digit -> 811 12 13 14 15 16 17 18 19 Input String And Press "ENTER