COMPILER DESIGN

Previous
Next

LEXICAL ANALYSIS

REGULAR EXPRESSIONS AND FINITE AUTOMATA

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
The terminals are designated by ____ letters, while the non-terminals are designated by ____ letters.
A
Capital, bold
B
Small, capital
C
Capital, small
D
Small, bold
Explanation: 

Detailed explanation-1: -A production of the form: Nonterminal → one Nonterminal is called a unit production. Theorem. Let L be a language generated by a CFG that has no -productions.

Detailed explanation-2: -Terminal symbols are literal symbols that may appear in the outputs of the production rules of a formal grammar and which cannot be changed using the rules of the grammar.

Detailed explanation-3: -Which of the following is a simulator for non deterministic automata? Explanation: JFLAP is a software for experimenting with formal topics including NFA, NPDA, multi-tape turing machines and L-systems.

Detailed explanation-4: -42. Which of the following correctly recognize the symbol ‘|-’ in context to PDA? a) Moves b) transition function c) or/not symbol d) none of the mentioned Answer: a Explanation: Using this notation, we can define moves and further acceptance of a string by the machine.

There is 1 question to complete.
Previous
Next