Introduction to Syntax/Exercise 1: Difference between revisions
From Wiki**3
< Introduction to Syntax
| Line 2: | Line 2: | ||
Consider the following grammar: | Consider the following grammar: | ||
bexpr -> bexpr or bexpr | bterm | bexpr -> bexpr or bexpr | bterm | ||
bterm -> bterm and bterm | bfactor | bterm -> bterm and bterm | bfactor | ||
bfactor -> not bfactor | ( bexpr ) | true | false | bfactor -> not bfactor | ( bexpr ) | true | false | ||
# Identify the terminal and non-terminal symbols of the grammar. | # Identify the terminal and non-terminal symbols of the grammar. | ||
Revision as of 11:05, 8 April 2008
The Problem
Consider the following grammar:
bexpr -> bexpr or bexpr | bterm bterm -> bterm and bterm | bfactor bfactor -> not bfactor | ( bexpr ) | true | false
- Identify the terminal and non-terminal symbols of the grammar.
- Show that the grammar is ambiguous by deriving two different trees for the same input sequence.
- Write a non-ambiguous grammar for the same language.
- Build the tree corresponding to the analysis of the following input sequence: not ( true or false and true )