LANGUAGE PROCESSING SYSTEMS QB

What is a language processing system?

Language processing system is a …

Which of the following is a prime component of any language processing system?

Which of the following is the program that converts high-level language to assembly language?

Which of the following is the program that converts the assembly language to machine-level language?

The …………. Removes all the #include directives by including the files called file inclusion and all the #define (constants) directives using macro expansion.

Which of the following LPSs combines compilation and interpretation processes? Where the source program is first compiled into a bytecode, that is interpreted by a virtual machine

The compiler can give better error diagnostics than the interpreter, because it executes the source program statement by statement.

The machine-language target program produced by a compiler is faster than an interpreter at mapping inputs to outputs.

A compiler is preferable to an interpreter because ……

A programmer, writes a program to multiply two numbers instead of dividing them by mistake, how can this error be detected?

Which of the following is a stage of compiler design?

What is the use of the symbol table in compiler design?

the front-end of the compiler is the ……. phase, while its back end is the …… phase

The input of the compiler’s front-end is.……., while its output is.……

The input of the compiler’s back-end is.……., while its output is .……

Which of the following is the function of the analysis phase?

The function of the synthesis phase of the compiler is to

the analysis phase of the compiler consists of the following except:

The first phase of the compiler that works as a text scanner is the ………

The output of the lexical analyzer is …………

The synthesis phase of the compiler consists of the following except:

The syntax analyzer or parser takes the ……… as input and generates …..

The scanner checks if the expression made by the tokens is syntactically correct

The parser scans the source code as a stream of characters and converts it into meaningful lexemes

The parser tries to map a program to the syntactic elements defined in the grammar?

Which of the following is not the role of the semantic analyzer?

In order to speed up the program execution without wasting resources (CPU, memory), ……….. Must be applied.

An optimizing compiler

The role of the code generator is to

Which of the following is a data-structure that is maintained throughout all the phases of a compiler.

Symbol table makes it easier for the compiler to quickly search the identifier record and retrieve it.

Context free grammars are used to represent programming language syntaxes.

The ……….. Of a programming language describes the proper form of its programs, while the …… … of the language defines what each program does when it executes.

€�……… is done by attaching rules or program fragments to productions in a grammar.

Syntax-directed translations is utilized for

Syntax Analyzer takes Groups Tokens of source Program into Grammatical Production.

Suppose one of the operands of an operation is a string and the other is an integer. During the syntax analysis, will the parser detect any syntax errors?

€�…….. Is the process of determining how a string of terminals can be generated by a grammar.

A context-free grammar has ……………

The ……………. Are syntactic variables that denote sets of strings. They define sets of strings that help define the language generated by the grammar.

€�………… are the basic symbols from which strings are formed.

The ……………. Of a grammar specify the manner in which the terminals and non-terminals can be combined to form strings..

The strings are derived from the start symbol by repeatedly replacing a non-terminal by the right side of a production, for that non-terminal.

A …………. Is a sequence of production rules, to get the input string.

If the sentential form of an input is scanned and replaced from left to right, it is called …………

A bottom-up parser generates ……..

If the sentential form of an input is scanned and replaced from right to left, it is called …………

Which of the following derivations does a top-down parser use while parsing an input string?

A ……... Is a graphical depiction of a derivation. It is convenient to see how strings are derived from the start symbol.

A parse tree is convenient to see how strings are derived from the start symbol, and the start symbol of the derivation becomes the interior node of the parse tree.

In parse trees, the operator in the deepest sub-tree gets precedence over the operator which is in the parent nodes.

A grammar is said to be …………. If it has more than one parse tree (left or right derivation) for at least one string.

Ambiguity in grammar is not good for a compiler construction. But there are Many methods can detect and remove ambiguity automatically.

Ambiguity in grammar can be removed by ……

In most programming languages, the four arithmetic operators, addition, subtraction, multiplication, and division are ………., while operators such as exponentiation are …………

When the parser starts constructing the parse tree from the start symbol and then tries to transform the start symbol to the input, it is called…….

Efficient parsers can be constructed more easily by hand using bottom-up parsing.

Bottom-up parsing can handle a larger class of grammars and translation schemes, thus software tools for generating parsers directly from grammars use bottom-up methods.

Left as well as right most derivations can be in Unambiguous grammar?

A top-down parser generates …………

Given the following expression grammar: E -> E * F | F+E | F F -> F-F | id .which of the following is true?

€�……… breaks the syntaxes into a series of tokens, by removing any whitespace or comments in the source code.

The role of the lexical analyzer is to ..…….

Separation between the Lexical Analysis and Parsing is required, for more simple design, and for compiler efficiency, and portability enhancement.

Lexical analyzer represents lexemes in the form of tokens as

In C language, int is a/an

The lexical analyzer will break down the following C statement into……… printf (“the value of x is %d”, x );

€�….… is an abstract symbol representing a lexical unit that is then processed by the parser.

The ………. Is a description of the form that the lexemes of a token may take. In case of keywords, it will be a sequence of characters, while in case of identifiers it gets more complex structure.

€�………is a sequence of characters in the source program that matches the pattern for a token and is identified by the lexical analyzer as an instance of that token.

A pattern (model) explains what can be a/an …….

Token name influences parsing decisions, while the attribute value influences translation of tokens after the parse.

€�……….is any finite set of symbols such as letters, digits, and punctuation

. …… . Is any countable set of strings over some fixed alphabet.

Regular languages could be described by means of ……..

..……… is an important notation for specifying lexeme patterns. They cannot express all possible patterns, but very effective in specifying those types of patterns needed for tokens.

In lexical analysis, the most important operations on languages are union, concatenation, and closure, where…….. Has the highest precedence, while ……… has the lowest precedence.

Let L be the set of letters {A, B,.., Z, a, b,…, z). The set of all strings of letters, including ε the empty string is described by ……….

The regular expression that describes language L over Σ={0,1} consist of strings starting and ending with 1 is……

The regular expression that describes language L over Σ={0, 1} consist of strings containing three consecutive ones is……..

The regular expression that describes language L over Σ={0, 1} consist of strings starting with 0 and ending with 1 is ……..

The regular expression that describes language L over Σ={a, b} consist of strings with any length ending with abb is ……..

The regular expression a|b* describes which of the following languages over Σ={a, b}?

The regular expression ab*(c|ε) describes which of the following languages over Σ={a, b, c}?

If L and M are two different regular languages, then the new language formed by (L . M) is the same language formed by (M . L)?

Regular expression a|a*b denotes the language {a, b, ab, aab,aaab,. . .), thus string a and all strings consisting of zero or more a's and ending with b, are accepted.

€�………. Have no restrictions on the labels of their edges. While, ………. Have for each state, and for each symbol of its input alphabet exactly one edge with that symbol.

€�……… are represented by a transition table where each entry is a single state without the curly braces of sets.

An edge may be labeled by ɛ, the empty string, instead of, or in addition to, symbols from the input alphabet, in the transition graphs of …..

Both deterministic and nondeterministic finite automata can recognize the same regular language?