Class work #6 -- Push-down Automaton

[Akif Eyler]

Class work #6

Modify delta() for this grammar:

  E -> TX

  X -> ε | +TX | -TX

  T -> FY

  Y -> ε | *FY | /FY

  F -> n | (E) | i(E) 

Include several test cases such as (n-i(n+n))/i(n*n)

Compare and contrast Recursive-descent vs PDA implementations

Ref:

• PDA sample
• Left Recursion
• microJ work

_Akif_Eyler_