Compilers Questions and Answers – Finite Automata – 1

This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Finite Automata – 1”. 1. A language L from a grammar G = { VN, Σ, P, S} is? a) Set of symbols over VN b) Set of symbols over Σ c) Set of symbols over P d) Set of symbols over S … Read more

advertisement

Compilers Questions and Answers – Relations – 2

This set of Compilers Questions and Answers for Freshers focuses on “Relations – 2”. 1. If A ∩ B = B, then? a) A ⊂ B b) A = ø c) B ⊂ A d) B = ø 2. Empty set is a _____________ a) Invalid set b) Infinite set c) Finite set d) None … Read more

advertisement

Compilers Questions and Answers – Relations – 1

This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Relations – 1”. 1. (a,b) what is a? a) Domain b) Range c) Domain & Range d) None of the mentioned 2. (a,b) what is b? a) Domain b) Range c) Domain & Range d) None of the mentioned 3. R is said … Read more

advertisement

Compilers Questions and Answers – Regular Expression – 2

This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Regular Expression – 2”. 1. The RE in which any number of 0′s is followed by any number of 1′s followed by any number of 2′s is? a) (0+1+2)* b) 0*1*2* c) 0* + 1 + 2 d) (0+1)*2* 2. The regular expression … Read more

advertisement

Compilers Questions and Answers – Regular Expression – 1

This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Regular Expression – 1”. 1. A regular expression enables a quick test to determine objects and text strings with undependable values. a) True b) False 2. RE can be used only for values of type string and number. a) True b) False 3. … Read more

advertisement

Compilers Questions and Answers – Lexical Analysis – 2

This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Lexical Analysis – 2”. 1. What constitutes the stages of the compilation process? a) Feasibility study, system, design, and testing b) Implementation and documentation c) Lexical analysis, syntax, Analysis and code generation d) None of the mentioned 2. The lexical analyzer takes _________ … Read more

advertisement

Compilers Questions and Answers – Lexical Analysis – 1

This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Lexical Analysis – 1”. 1. What is the output of lexical analyzer? a) A set of RE b) Syntax Tree c) Set of Tokens d) String Character 2. Which symbol table implementation is based on the property of locality of reference? a) Linear … Read more

advertisement

Compilers Questions and Answers – Cross Compiler – 2

This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Cross Compiler – 2”. 1. If we compile the sam.c file with the command “gcc -o sam sam.c”, then the executable file will be? a) a.out b) sam c) sam.out d) None of the mentioned 2. What will be output of the following … Read more

advertisement

Compilers Questions and Answers – Cross Compiler – 1

This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Cross Compiler”. 1. A system program that combines separately compiled modules of a program into a form suitable for execution is called ___________ a) Assembler b) Linking loader c) Cross compiler d) None of the mentioned 2. A compiler for a high-level language … Read more

advertisement

Compilers Questions and Answers – Finite Automata and Regular Expressions – 2

This set of Compilers Interview Questions and Answers focuses on “Finite Automata and Regular Expressions – 2”. 1. Which of the following strings is not generated by the following grammar? S → SaSbS|ε a) aabb b) abab c) aababb d) aaabbb 2. Regular expressions can be used only for values of type string and number. … Read more

advertisement
Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to get free Certificate 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 - Founder & CTO at Sanfoundry
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.