COMPILER DESIGN

Previous
Next

TOOLS AND TECHNIQUES FOR COMPILER DESIGN

MISCELLENOUS

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
We have two statements S1 and S2 whose definition are as follows:S1-{02n In ≥ I} is a regular language.S2-{0m 1n 0 1m+n I m=1 and n≥1I is a regular language.
A
Both S1 and S2 are correct
B
Only S2 is correct
C
Only S1 is correct
D
Neither S1 nor S2 is correct
Explanation: 

Detailed explanation-1: -Every finite language is regular, that means if there is a limit to the language then we can say it is regular. For example, consider the language given below − L = a10b20 is regular language whereas, L = anbn| n > 0 is not regular.

Detailed explanation-2: -Regular languages are formal languages that regular expressions can describe and can also be recognized by finite automata. They are used to define sets of strings, such as sequences of characters or words, that follow specific patterns.

Detailed explanation-3: -Which of the following is/are non regular? Explanation: There is no regular expression that can parse HTML documents. Other options are also non-regular as they cannot be drawn into finite automaton.

There is 1 question to complete.
Previous
Next