Welcome to the Bottom Up Parsing MCQs Page

Dive deep into the fascinating world of Bottom Up Parsing with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Bottom Up Parsing, a crucial aspect of Compiler Design. In this section, you will encounter a diverse range of MCQs that cover various aspects of Bottom Up Parsing, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Compiler Design.

Check out the MCQs below to embark on an enriching journey through Bottom Up Parsing. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Compiler Design.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Bottom Up Parsing. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Bottom Up Parsing MCQs | Page 2 of 5

Explore more Topics under Compiler Design

01

Introduction to Compilers

02

Finite Automata and Regular Expression

03

Context Free Grammar and Syntax Analysis

04

Topdown Parsing

05

Syntax Directed Definition and Translations

06

Symbol Table

07

Storage Management

08

Error Handling

09

Code Optimization

10

Code Generation

Q11.

AB+(A+B)’ is equivalent to

A?B

A+B

(A+B)A

(A+B)B

Discuss

Answer: (a).A?B

Q12.

Which of the following is the fastest logic ?

TTL

ECL

CMOS

LSI

Discuss

Answer: (b).ECL

Q13.

A latch is constructed using two cross coupled

AND OR gates

AND gates

NAND and NOR gates

NAND gates

Discuss

Answer: (d).NAND gates

Q14.

DAG representation of a basic block allows

Automatic detection of local common sub expressions

Detection of induction variables

Automatic detection of loop variant

None of the mentioned

Discuss

Answer: (a).Automatic detection of local common sub expressions

Q15.

Which of the following actions an operator precedence parser may take to recover from an error?

Insert symbols onto the stack

Delete symbols from the stack

Inserting or deleting symbols from the input

All of the mentioned

Discuss

Answer: (d).All of the mentioned

Q16.

Which of the following is used for grouping of characters into tokens?

Parser

Code optimization

Code generator

Lexical analyser

Discuss

Answer: (d).Lexical analyser

Q17.

A optimizing compiler

Is optimized to occupy less space

Is optimized to take less time for execution

Optimized the code

None of the mentioned

Discuss

Answer: (c).Optimized the code

Q18.

Input to code generator

Source code

Intermediate code

Target code

All of the mentioned

Discuss

Answer: (b).Intermediate code

Q19.

A synthesized attribute is an attribute whose value at a parse tree node depends on

Attributes at the siblings only

Attributes at parent node only

Attributes at children nodes only

None of the mentioned

Discuss

Answer: (c).Attributes at children nodes only

Q20.

In a bottom up evaluation of a syntax direction definition ,inherited attributes can

Always be evaluated

Be evaluated only if the definition is L –attributed

Evaluation only done if the definition has synthesized attributes

None of the mentioned

Discuss

Answer: (c).Evaluation only done if the definition has synthesized attributes

Page 2 of 5

Welcome to the Bottom Up Parsing MCQs Page

Bottom Up Parsing MCQs | Page 2 of 5

Explore more Topics under Compiler Design

Introduction to Compilers

Finite Automata and Regular Expression

Context Free Grammar and Syntax Analysis

Topdown Parsing

Syntax Directed Definition and Translations

Symbol Table

Storage Management

Error Handling

Code Optimization

Code Generation

Suggested Topics

CSS

Object Oriented Programming

R Programming

Python

Human Computer Interaction

Compiler Design

Big Data Computing

DBMS

UNIX