Compiler: LR parsing 4: create a state machine and parsing table - Example 2
Channel: LernenInVerschiedenenFormen
Date: 2018-11-29

Information: 
1:02 The reason why the first state has all rules:
- It basically start with r0 (Z → ・E$)
- The marker is before the non-terminal symbol "E" ('variable' "E"). Therefore all rules starting with an "E" must also be written in the state: E → ・T and E→・E+T.
- Now we have "・T": same game: We must also add r3 and r4:
  T→ ・F and T→ ・T*F.
- Same game for "・F": add rule 5: F→・i

Empfehlung: Mit 1,5-facher Geschwindigkeit angucken

Falls Fehler gefunden werden: bitte in die Kommentare :)

Video erstellt mit HyperCam2