The first stack is the start symbol and add $ before it

Input will be given

How to determine the output?

• By comparing the right most of the stack and the left most of the input

rules

• Stack gets replaced by the production values or the thing that comes after the -> but reverse it
• If stack == input POP STACK AND INPUT
• if there is ε after -> POP STACK
• if stack == $ and input == $ ACCEPT
• if stack ≠ input REJECT

Status: #idea
Tags: compilation-techniquesCompilation Techniques Notes* [ ] Assigments RE to DFA Example Kenny Jingga CT UTS Quiz kennydfa1.png kennydfa2.png kennydfa3.png Example Ivan Sebastian CT UTS Quiz RE to E-NFA to DFA Example Kenny Jingga CT UTS Quiz kenny1.png Example Ivan Sebastian CT UTS Quiz ivan2.png WRONGGGG Context Free Grammar Top down parsing Example Alvina Aulia Top Down Parsing 1. E -> TE' 1. E' -> +TE' | ε 1. T -> FT' 1. T' -> \FT'* | ε 1. F -> (E) | id First Values: 1. First E = (, id (this is from E -> T -> F) 1. First E' =

---

References