INTERMEDIATE CODE GENERATION
SYNTAX TREES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
-closure
|
|
|
-park
|
|
|
Q in the tuple
|
|
|
None of the mentioned
|
Detailed explanation-1: -The of a set of states, P, of an NFA is defined as the set of states reachable from any state in P following e-transitions. Explanation: The e-closure of a set of states, P, of an NFA is defined as the set of states reachable from any state in P following e-transitions.
Detailed explanation-2: -Which of the following do we use to form an NFA from a regular expression? Explanation: Thompson Construction method is used to turn a regular expression in an NFA by fragmenting the given regular expression through the operations performed on the input alphabets.
Detailed explanation-3: -More formally, the transition function in an NFA with -transitions has a slightly larger domain : Q × ( ∪ ) → 2Q. The -reach of a state q ∈ Q consists of all states r that satisfy one of the following conditions: 4 either r = q, 4 or r ∈ (q, ) for some state q in the -reach of q. ∗(q, x) if w = ax.