retagged by
2,392 views

3 Answers

2 votes
2 votes
i think none of the answers are right option a it can be included by finite automata but not by a regular expression (regular expressions is an important notation for specifying a pattern each pattern matches a set of strings so regular expressions serve as names for a set of strings tokens can be described using regular languages )

option b if it can be modeled by ndfa then it can also be modeled by dfa also this statement is wrong

option cif it can be modeled by E-NDFA then it can be modeled by DFA also if it can be modeled by dfe it can be modeled in right linear grammar

option d option a explanation
0 votes
0 votes
There are two types of regular grammers.

1) regular right linear :  S->aA

2) regular left linear : S->Aa

Both can easily generate regular languages , hence can easily implement lexical  phase.

D is not correct.
–1 votes
–1 votes
Regular expressions, Finite Automata and NFA with e-moves have the same power of lexical analyser. See the equivalance of automata and regular expressions in ullman text.But grammars have higher power than the previous 2 models.Hence D.

Related questions

0 votes
0 votes
1 answer
1
shikharV asked Nov 19, 2015
542 views
Given answer: CBut I believe that syntax analyzer is just for checking the form of the source code. The meaning of the program is interpreted in semantic analyzer phase o...
0 votes
0 votes
1 answer
3
Hira Thakur asked Dec 3, 2016
685 views
lexical error is______1.an error produced by LA when illegal character is appear2.an error produced by LA when missing left parenthesis in expression3.an error produced b...
6 votes
6 votes
7 answers
4
Na462 asked Oct 5, 2018
3,409 views