| | |
Summary: 1
Homework 3 10 points
Note, these exercises may be done in groups of one, two, or three. Working with someone else is strongly
recommended. If more than one person is involved, list all the names on ONE set of answers.
Syntax
1. Given the regular expression (a|b|c*)bb use Thompson's construction to produce a
NFA (non-deterministic finite automata).
2. For the NFA(non-deterministic finite
automata) to the right, use the subset
construction (discussed in class) to create a
DFA(deterministic finite automata)
3. Consider the grammar below where , ,
andİ are some unspecified binary operators.
E TE | EİT |T
T F T |F
F (E) |a
i. What are the terminals of this grammar? The non-terminals?
ii. What kind of associativity does have?
iii. What kind of associativity does have?
iv. What kind of associativity does İ have?
|
