Chkeck how much u have prepared Unit 1 is SS !

1 What is the outcome of Parser?

String.

Parse Tree

2 In case of LL(1) Parsing First L means ?? and Second L denotes ??

First L->Leftmost Derivation and Second L-> Left to Right

First L -> Left to Right and Second L-> Leftmost derivation.

3 Which data structure grows as and when a data is added?

Stack

Heap

4 Large development time is a drawback of ??

Execution Gap.

Semantic Gap.

5 Simplicity and Generality are the Silent features of ?

TDP / Bottom up Parsing / LL(1) Parsing

RDP

6 Why do we need RE and FA?

For validations.

For Creating Tokens.

7 Basic types of Data Structure are Linear and Non-Linear : Say True / False.

False

True

8 Language processor makes frequent use of data structure for what purpose?

Allocation and Deallocation.

Sorting and Searching.

9 Fill in the Blank : _____________ Contains only Terminals.

Grammar Symbols.

String or sentence.

10 What are the actions of Toy Compiler?

Lexical Analysis ,Syntax Analysis and Semantic Analysis.

Scanning , Parsing and Semantic Analysis.

11 Which data structure is used to store the information of all Identifiers?

Optab.

Symtab.

12 What is the outcome of Language Processor?

IC

TC

13 Sequential allocation of memory is also called as ___________. ( Fill in the Blank)

array

contiguous

14 Which is the non-linear data structure?

Array

Heap

15 On which mode the stack Works?

FIFO / LIFO

LIFO