0% found this document useful (0 votes)
214 views1 page

Bottom Up Parsing Compilers Questions and Answers Sanfoundry

Uploaded by

joneman502
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
214 views1 page

Bottom Up Parsing Compilers Questions and Answers Sanfoundry

Uploaded by

joneman502
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Branchwise MCQs School MCQs DSA Test Job Internship Training Videos Books Contact

1000 Compilers MCQs


Compilers Questions and Answers – Bottom-Up Parsing-1

This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Bottom-Up Parsing”.

1. Inherited attribute is a natural choice in ___________


a) Variable declarations record is maintained
b) L values and R values
c) All of the mentioned
d) None of the mentioned
Compiler Introduction
View Answer
Compiler - Expressions - 1

Compiler - Expressions - 2 2. YACC builds up __________


Compiler - Cross Compiler - 1 a) SLR parsing table
Related Topics
b) Canonical LR parsing table
Compiler - Cross Compiler - 2
c) LALR parsing table JavaScript MCQ Questions
Compiler - Lexical Analysis-1
d) None of the mentioned Compiler Design MCQ Questions
Compiler - Lexical Analysis-2
View Answer C++ Algorithm Library
Compiler - Regex - 1
C# Array Programs
Compiler - Regex - 2 3. In an absolute loading scheme which loader function is accomplished by assembler? C Programming MCQ Questions
Compiler - Relations - 1 a) Re-allocation
Compiler - Relations - 2
b) Allocation
c) Linking
Finite Automata & Regular d) Loading
Expression
View Answer
Compiler - Finite Automata-1

Compiler - Finite Automata-2

Compiler - Non DFA - 1 advertisement

Compiler - Non DFA - 2

Compiler - NFA to DFA - 1

Compiler - NFA to DFA - 2

Compiler - Epsilon-Moves - 1

Compiler - Epsilon-Moves - 2

Compiler - DFA - 1 Experience Smooth Skin with Our


Compiler - DFA - 2
Expert Hair Removal!
Experience Smooth Skin with Our Expert Hair
Compiler - DFA Minimization-1 Removal!
Compiler - DFA Minimization-2 sponsored by: Topic | Search Ads APPLY NOW
Compiler - Regexp Automata-1
Streamline Onboarding with
Compiler - Regexp Automata-2
Our Software for Small…
Compiler - Lexical Analyser - 1 4. A parser with the valid pre x property is advantageous because it __________ Streamline Onboarding with Our
a) Detects errors Software for Small Businesses!
Compiler - Lexical Analyser - 2
sponsored by: Topic | Search Ads
b) None of the mentioned
Contextfree Grammar &
c) Errors are passed to the text phase APPLY NOW
Syntax Analysis
d) All of the mentioned
Topdown Parsing
View Answer Popular Pages

Bottom Up Parsing Visual Basic MCQ Questions


5. The action of parsing the source program into proper syntactic classes is called __________ Finite Element Method MCQ Questions
Syntax Directed De nition & a) Syntax Analysis
Translations Object Oriented Programming MCQ Question
b) Lexical Analysis
c) Interpretation analysis Operating System MCQ Questions
Symbol Table
d) General Syntax Analysis Java Programs on Classes and Objects
Storage Management
View Answer
Error Handling
Answer: b
Best Reference Books Explanation: Conversion of characters to tokens.

Subscribe Now: Compiler Design Newsletter | Important Subjects Newsletters

6. Relocating bits used by relocating loader are speci ed by __________


a) Relocating loader itself
b) Linker
c) Assembler
d) Macro Processor

View Answer

7. What is the binary equivalent of the decimal number 368?


a) 10111000
b) 110110000
c) 111010000
d) 111100000

View Answer

8. AB+(A+B)’ is equivalent to __________


a) A?B
b) A+B
c) (A+B)A
d) (A+B)B

View Answer

9. A top down parser generates __________


a) Rightmost Derivation
b) Right most derivation in reverse
c) Left most derivation
d) Left most derivation in reverse

View Answer

Answer: c
Explanation: Top-down parsing is a parsing strategy where one rst looks at the highest level of the parse
tree and works down the parse tree by using the rewriting rules of a formal grammar.

10. Running time of a program depends on __________


a) Addressing mode
b) Order of computations
c) The usage of machine idioms
d) All of the mentioned

View Answer

Sanfoundry Global Education & Learning Series – Compilers.

To practice all areas of Compilers, here is complete set of 1000+ Multiple Choice Questions and Answers.

If you nd a mistake in question / option / answer, kindly take a screenshot and email to
[email protected]

« Prev - Compilers Questions and Answers – » Next - Compilers Questions and Answers – Bottom-
Predictive Top-Down Parsing Up Parsing-2

Related Posts:

Practice Computer Science MCQs


Apply for Computer Science Internship
Practice MCA MCQs
Check Computer Science Books
Check Compiler Design Books

Recommended Articles:
1. Compilers Questions and Answers – Bottom-Up Parsing-2
2. Compilers Questions and Answers – Top-Down Parsing – 2
3. Compilers Questions and Answers – Top-Down Parsing – 1
4. Compilers Questions and Answers – Predictive Top-Down Parsing
5. Compilers Questions and Answers – Data Structure for Representing Parsing Table – 2
6. Compilers Questions and Answers – Data Structure for Representing Parsing Table – 1
7. Compilers Questions and Answers – Error Recovery in LR phase – 2
8. Compilers Questions and Answers – LR Parser – 1
9. Python Multiple Choice Questions – Argument Parsing
10. MATLAB Questions and Answers – Commands for Parsing Input and Output – 1

Subscribe: Compiler Design Newsletter

Name

Email

Subscribe

Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certi cation contest to get free
Certi cate of Merit. Join our social networks below and stay updated with latest contests, videos, internships
and jobs!

Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder
and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux
Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected
with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram


SanfoundryClasses.

About | Certi cations | Internships | Jobs | Privacy Policy | Terms | Copyright | Contact

     

© 2011-2024 Sanfoundry. All Rights Reserved.

You might also like