CS606 Final Term Current Papers 2022 by Masters

CS606 Final Term Preparation:

Paper#1

Cs606 Current Paper Final Term Spring 2022

Almost Mcqs are from junaid file 35.

1. The shift action___________ a terminal on the stack.

Pushes (page 73)

2. The regular expressions a*|b* and (a|b)* describe the_______set of strings.

Different

3. Yacc contains built-in support for handling ambiguous grammars resulting in____________ conflicts.

Shift-reduce

4. For convenience, lexical analyzers should read the complete ___ program into memory.

Input

5. The code generator uses_____________ for keeping track of register.

Two data structures

6. Address descriptor is the location where the_______ for a variable can found.

Current value

7. When constructing an LR(1) parser we record for each item exactly in which context it appears, which resolves many conflicts present in_ parsers based on FOLLOW sets.

SRL(1)

8. The order in which the DAG is traversed can lead to_______ code.

Better

9. . Three-address codes are often implemented as a________

Set of quadruples

10. Start symbol start with________

S

11. ___is the process of discovering a derivation for some sentence of a language.

Parsing

12. LALR(1) leads to tables that have ___________fewer states than LR(1)

10 times

13. Token are stored in_______.

Stack

14. Values used to compute____ attributes flow bottom-up in the parse tree.

Synthesized

15. Back patching is especially suited for________.

bottom-up parsers.

Subjective 1. Top down parser may pick the wrong production and In that case it will need to backtrack, can every grammar back track inn such situation. (Lecture12)

2. Which information we can get from the second section of the YACC file? Most important

%20several%20sections%20describe,the%20preparation%20of%20lexical%2 0analyzers.