edited by
393 views
0 votes
0 votes

Recall the $\text{CFG}$  $G_{4}$ that we gave in $\text{Example 2.4}.$ For convenience,let’s rename it’s variable with single letters as follows,

                                            $E\rightarrow E+T|T$

                                            $T\rightarrow T\times F|F$

                                            $F\rightarrow (E)|a$

Give parse trees and derivations for each string.

  1. $a$
  2. $a+a$
  3. $a+a+a$
  4. $((a))$
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
1 votes
1 votes
0 answers
4