Syntax Trees: The syntax trees graphically represent the derivation of any word. While drawing syntax tree for any word, we start from the start symbol S which is placed at the root of the tree. Then we draw a downward line for every symbol appearing in the production of that non-terminal. The leaves of the syntax tree will be the terminals of the CFG. Example: Consider the following CFG S A A A A A A | bA | Ab | a The syntax tree to generate a word bbaaaab is as follows:

??