BPSC TRE – Compiler Design: Syntax Analysis & Parsing | Test 1

Questions 26-30 of 50

0% completed (0/50 answered)
Your score 0/50 0 answered
Correct 0 Incorrect 0 Unanswered 50 Accuracy 0%

Question 26

MCQ · Single Correct 1 mark

Which function in LL(1) parsing computes the set of terminal symbols that can appear immediately to the right of non-terminal A in some sentential form?

Answers for question 26

Question 27

MCQ · Single Correct 1 mark

Which special symbol is always included in the FOLLOW set of the Start Symbol S of a grammar?

Answers for question 27

Question 28

MCQ · Single Correct 1 mark

In constructing an LL(1) parsing table M[A, a], if a production A -> \alpha contains \epsilon in FIRST($\alpha)$, which entries are updated?

Answers for question 28

Question 29

MCQ · Single Correct 1 mark

Which error recovery strategy in Syntax Analysis discards input tokens one by one until a designated 'synchronizing token' (e.g., semicolon or brace) is encountered?

Answers for question 29

Question 30

MCQ · Single Correct 1 mark

Which error recovery strategy performs local corrections on remaining input (e.g., replacing comma with semicolon, or inserting a missing parenthetic token)?

Answers for question 30
Scroll to Top