MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
State true or false:
Statement: R->R|T T->..
1.
State true or false:
Statement: R->R|T T-> is an ambiguous grammar
A.
true
B.
false
Answer» B. false
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
In context to ambiguity, the number of times the following programming statement can be interpreted as:<br>Statement: if R then if T then P else V
State true or false:<br>Statement: R->R|T T-> is an ambiguous grammar
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply