
2. Given is the following BNF grammar: < comp op > ”<‘ I ”<-” I ‘ל” I ”>-” I ”–” I ”’-” -> arith op 〉 → + 1-1 * 1/ < paren〉 → “(” I “) ” token 〉 → 〈 comp op 〉 | 〈 arith op 〉 I 〈 paren 〉 Construct a DFA that accepts the strings in < token 〉. Show
PayPal Gateway not configured
PayPal Gateway not configured