Compilers

Syntax Analyser

Question 1
Marks : +2 | -2
Pass Ratio : 100%
Output file of Lex is __________ the input file is Myfile.
Myfile.e
Myfile.yy.c
Myfile.lex
Myfile.obj
Explanation:
This Produce the filr “myfile.yy.c” which we can then compile with g++.
Question 2
Marks : +2 | -2
Pass Ratio : 100%
Syntax Analyser is also known as ___________
Hierarchical Analysis
Hierarchical Parsing
None of the mentioned
Hierarchical Analysis & Parsing
Explanation:
It is also called as Hierarchical Analysis or Parsing.
Question 3
Marks : +2 | -2
Pass Ratio : 100%
In Short Syntax Analysis Generates Parse Tree.
True
False
Explanation:
Short Syntax Analysis generates a parse tree.
Question 4
Marks : +2 | -2
Pass Ratio : 100%
Parsers are expected to parse the whole code.
True
False
Explanation:
Parsers are expected to parse the whole code even if some errors exist in the program.
Question 5
Marks : +2 | -2
Pass Ratio : 100%
A system program that combines the separately compiled modules of a program into a form suitable for execution?
Assembler
Compiler
Linking Loader
Interpreter
Explanation:
A loader which combines the functions of a relocating loader with the ability to combine a number of program segments that have been independently compiled.
Question 6
Marks : +2 | -2
Pass Ratio : 100%
Syntax Analyser takes Groups Tokens of source Program into Grammatical Production.
True
False
Explanation:
It Groups Tokens of source Program into Grammatical Production.
Question 7
Marks : +2 | -2
Pass Ratio : 100%
Suppose One of the Operand is String and other is Integer then it does not throw error as it only checks whether there are two operands associated with ‘+’ or not.
True
False
Explanation:
Syntax analyser does not check the type of the operand.
Question 8
Marks : +2 | -2
Pass Ratio : 50%
By whom is the symbol table created?
Compiler
Interpreter
Assembler
None of the mentioned
Explanation:
Symbol table is created by the compiler which contains the list of lexemes or tokens.
Question 9
Marks : +2 | -2
Pass Ratio : 100%
Which of these features of assembler are Machine-Dependent?
Instruction formats
Addressing modes
Program relocation
All of the mentioned
Explanation:
All of these options are features of assembler which are machine dependent.
Question 10
Marks : +2 | -2
Pass Ratio : 100%
From where it takes its input from?
Lexical analyser
Syntactic Analyser
Semantic Analyser
None of the mentioned
Explanation:
A syntax analyzer or parser takes the input from a lexical analyzer in the form of token streams.