Q4 : Determine the sets FIRST and FOLLOW for all non-terminals in the following grammar of binary logic, show the parse tree for (true or false)

Expr -> Term A

A -> or Term A |

Term -> Factor B

B -> and Factor B |

Factor -> not Factor | (Expr) | true | false

Note that terminal expressions are denoted in bold font. You need FOLLOW set for null-able non-terminals.

Q5: Determine the sets FIRST and FOLLOW for all non-terminals in the following grammar:

A -> BC | bA

B -> a |

C -> cBc