10 Multiple Choice Questions (MCQs) related to Syntax Analysis, useful for UGC NET, SET, and GATE exams:
1. What is the primary function of syntax analysis in a compiler?
A) Checking token validity
B) Checking grammatical structure
C) Optimizing code
D) Allocating memory
Explanation:
Syntax Analysis (Parsing) ensures that the sequence of tokens follows the grammar of the programming language.
Answer: B) Checking grammatical structure
2. Which data structure is commonly used in syntax analysis?
A) Queue
B) Stack
C) Linked List
D) Hash Table
Explanation:
Parsers use a stack to keep track of grammar rules and parsing states.
Answer: B) Stack
3. Which type of grammar is used for syntax analysis?
A) Regular Grammar
B) Context-Free Grammar
C) Context-Sensitive Grammar
D) Unrestricted Grammar
Explanation:
Context-Free Grammar (CFG) is used in syntax analysis to define language structure.
Answer: B) Context-Free Grammar
4. Which of the following is NOT a type of parser?
A) LL Parser
B) LR Parser
C) Recursive Descent Parser
D) Regular Expression Parser
Explanation:
Regular Expressions are used in Lexical Analysis, not in Syntax Analysis.
Answer: D) Regular Expression Parser
5. What is the role of a parse tree in syntax analysis?
A) It represents the sequence of tokens
B) It represents the hierarchical structure of the code
C) It stores symbol table information
D) It generates machine code
Explanation:
A parse tree shows the hierarchical structure of a program based on grammar rules.
Answer: B) It represents the hierarchical structure of the code
6. Which parsing technique uses a top-down approach?
A) LL Parsing
B) LR Parsing
C) Operator Precedence Parsing
D) Shift-Reduce Parsing
Explanation:
LL Parsing (Left-to-right, Leftmost derivation) is a top-down parsing technique.
Answer: A) LL Parsing
7. In bottom-up parsing, which action is performed first?
A) Deriving the start symbol
B) Expanding non-terminals
C) Shifting tokens onto the stack
D) Applying semantic rules
Explanation:
Bottom-up parsing starts with shifting tokens onto the stack, then reduces them to grammar rules.
Answer: C) Shifting tokens onto the stack
8. Which of the following parsers is used in YACC (Yet Another Compiler Compiler)?
A) LL Parser
B) LR Parser
C) Recursive Descent Parser
D) Operator Precedence Parser
Explanation:
YACC uses LR parsing techniques for bottom-up parsing.
Answer: B) LR Parser
9. Which of the following is NOT a bottom-up parsing method?
A) Shift-Reduce Parsing
B) LR Parsing
C) Operator Precedence Parsing
D) Recursive Descent Parsing
Explanation:
Recursive Descent Parsing is a top-down parsing method.
Answer: D) Recursive Descent Parsing
10. What is the worst-case time complexity of LR parsing?
A) O(n)
B) O(n²)
C) O(log n)
D) O(1)
Explanation:
LR parsing operates in O(n) time complexity, where n is the length of the input.
Answer: A) O(n)
Comments
Post a Comment