In the context of abstract-syntax-tree and control-flow-graph.
Which one of the following is true?
Which one of the following is true at any valid state in shift-reduce parsing?
Given the following expression grammar:
E → E * F | F + E | F
F → F – F | id
Which of the following is true?
Which of the following derivations does a top-down parser use while parsing an input string?
Which of the following statements is false?
A grammar that produces more than one parse tree for some sentence is called
S → C C
C → c C | d
The grammar is
A bottom up parser generates
A bottom up parser generates
In Lex, a class is complemented by first placing
The table created by lexical analysis to describe all literals used in the source program is
From where it take its input from?
__________or scanning is the process where the stream of characters making up the source program is read from left to right and grouped into tokens.
Task of the lexical analysis
The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?
The set of all strings over = {a, b} in which a single a is followed by any number of b’s a single b followed by any number of a’s is
The set of all strings over s= {a, b} in which all strings having bbbb as substring is ___________.
Assembler is a program that
The circuit used to store one bit of data is known as_______
An intermediate code form is
