COMPILER-QUIZ

JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.

COMPILER-QUIZ

Quiz on compiler design principles

NAME *

BRANCH, SEM *

email-ID

1) What does the following list of text represent? *

1 point

Charecters

Lexemes

Tokens

Patterns

2) The machine Independant Phases of a Compiler are grouped into what is known as a *

1 point

Back End

Front End

3) What does 'G' represent? *

1 point

Grammar

Context Free Grammar

Context Sensitive Grammar

Regular Grammar

4) A program that accepts a string of tokens and verifies whether the string can be generated by a grammar *

1 point

Scanner

Parser

5) A special case of recursive descent parser that does not require backtracking is known as *

1 point

LR Parser

Predictive Parser

Shift reduce parser

Bottom Up Parser

6) A method of parsing that starts at the bottom (leaves, terminals) and works its way up to the top (root, start symbol) is called *

1 point

Predictive Parsing

Top down parsing

Shift Reduce Parsing

Recursive Descent Parsing

7) A substring that matches the RHS of a production and whose reduction to the non-terminal (on the LHS of the production) represents one step along the reverse of a rightmost derivation toward reducing to the start symbol. *

1 point

Viabale Prefix

Handle

First

8) A form of shift reduce parsing that stipulates that the rhs of a production rule should not contain two adjacent non terminals *

1 point

LR Parsing

SLR Parsing

Operator Precedence Parsing

9) What does this relation ( a <. b) is called ? *

1 point

a " takes precedence over" b

a " Yields precedence to" b

10) what does this diagram represent? *

1 point

LR Parser

Predictive Parser

Operator Precedence Parser

11) Machine independent code that allows a compiler to be retargeted *

1 point

Target Code

Intermediate Code

Source Code

Object Code

12) A sequence of consequitive statements where the flow of control enters at the beginning and leaves at the end without halt *

1 point

Flow Graphs

Basic Blocks

13)It is pushed into a runtime stack when a procedure is called and popped off when control returns to the caller *

1 point

Activation record

Control Flow Graph

Basic block

14) Optimisation that ensures correctness and speeds up the process in compilers *

1 point

Peep hole optimisation

Code improvement transformations

15) What does the representation shown in the right (B) for the parse tree shown in the left (A) ? *

1 point

Quadruple

Three adderss code

16) Seperating the analysis phase of compiling into Lexical analysis and Parsing facilitates *

1 point

Retargetting

Improved efficiency and enhanced portability

17) Which of the following are not tokens? *

1 point

Operators

Key words

Indentifiers

White spaces

18) The different representation as shown in the right(B) of syntax tree shown in the left (A) is called a *

1 point

Three address code

DAG

19) Which of the following diagrams matches the grammar rule S-> If (B) S1 else S2 *

1 point

20) Data structures used for dynamic storage allocation at run time *

1 point

Static allocation

Heap and Stack

Submit

Clear form

Never submit passwords through Google Forms.

This form was created inside of VIVEK EDU SITE.

Does this form look suspicious? Report

Forms