Page 1 of 1
QUESTION 16 Below is a final state PDA that accepts all arithmetic expressions over the alphabet (int.(.).+} Rule1: (0.(
Posted: Sun Jul 10, 2022 11:25 am
by answerhappygod
- Question 16 Below Is A Final State Pda That Accepts All Arithmetic Expressions Over The Alphabet Int Rule1 0 1 (25.27 KiB) Viewed 72 times
QUESTION 16 Below is a final state PDA that accepts all arithmetic expressions over the alphabet (int.(.).+} Rule1: (0.(.?.push(().0), 0 is the start state Rule 2: (0,int,?,nop. 1) Rule 3: (1.).(.pop,1) Rule 4: (1,+,?,nop.0) Rule 5: (1.A,X,nop,final State). X is the start stack symbol What are the contents of the stack after the PDA follows transition rules: Rule 1. Rule 1, Rule 1, Rule 2 on the string (((int+int))) From Top to Bottom: (.(.(. (.X From Top to Bottom: (.(.X O From Top to Bottom: (.(.(.X. From Top to Bottom: (. (.(