Question

Consider the following BNF grammar that we saw in class:
       EXP    ::= EXP + TERM   | EXP - TERM    | TERM
       TERM   ::= TERM * FACTOR | TERM / FACTOR | FACTOR
       FACTOR ::= ( EXP ) | DIGIT
       DIGIT ::= 0 | 1 | 2 | 3

   (a) Translate into EBNF.
   (b) Draw syntax diagrams.
   (c) What are the two requirements on a grammar for a predictive parser to be able to make right choice?
   (d) Compute First and Follow sets for each of the non-terminals
   (e) Prove that the grammar satisfy the two requirements defined in (c).

Answer 1

0 ERNA

2- TBRm +ACTOR 心! arr at Cİ) 94 har the Capal,,tlp.to nechet- (It)

Vaaale vuna,