Multiple Choice
A grammar is considered to be context-free if ____.
A) each terminal can be replaced by any right-hand side choice, no matter where it appears
B) each nonterminal can be replaced by any right-hand side choice, no matter where it appears
C) context strings appear on the left-hand sides of grammar rules
D) the grammar also expresses the semantics of the language
Correct Answer:

Verified
Correct Answer:
Verified
Q2: The lexical structure of a programming language
Q3: A recognizer is a program that accepts
Q4: Most modern languages are in a completely
Q5: A grammar for which two distinct parse
Q6: Derivation is the process that replaces left-hand
Q8: In extended Backus-Naur form,square brackets [ ]
Q9: Shift-reduce parsers shift tokens onto a stack
Q10: _ are phrase structures that are broken
Q11: A conflict between syntax and semantics arises
Q12: In a regular expression,repetition is indicated by