Two finite state machines are said to be equivalent only if

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

Two finite state machines are said to be equivalent only if they

Ahave the same number of states

Bhave the same number of edges

Chave the same number of states and also the same number of edges

Drecognise the same set of tokens.

No answer description available for this question. Let us discuss.

View Answer

Discuss

most closely describes the regular expression 01 * 0

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

Which statement most closely describes the regular expression 01 * 0 ?

AIt represents a finite set of finite strings

BIt represents an infinite set of finite strings

CIt represents a finite set of infinite strings

DIt represents an infinite set of infinite strings.

Akilesh Kharvi ? Dec 8 '2016 at 21:49

Answer:It represents an infinite set of finite strings

Explanation:

The Regular Expression 01*0 means
The set of ==> {00,010,0110,01110,011110,0111110,01......0, and so on.}
so the length of the string like 00 and 011110 are finite and the set is infinite due to 1*
so the ans is B.

View Answer

Discuss

All compilers are designed to be

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

All compilers are designed to be

Arecursive

Bserially usable

Cself correcting

Dre-entrant.

Akilesh Kharvi ? Dec 8 '2016 at 21:48

Answer: re-entrant

Explanation:

Compilers and other programs were often written to be reentrant, so a single copy of the tool lived in memory, yet was shared by perhaps a hundred users. Each person had his or her own data area, yet everyone running the compiler quite literally executed identical code. As the operating system changed contexts from user to user it swapped data areas so one person's work didn't effect any other. Share the code, but not the data.
In the embedded world a routine must satisfy the following conditions to be reentrant:
->It uses all shared variables in an atomic way, unless each is allocated to a specific instance of the function.
->It does not call non-reentrant functions.
->It does not use the hardware in a non-atomic way.

View Answer

Discuss

Generation of intermediate code based on an abstract machine

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

Generation of intermediate code based on an abstract machine model is useful in compilers because

Ait makes the implementation of lexical analysis and syntax analysis easier

Bsyntax directed translations can be written for intermediate code generation

Cit enhances the portability of the front end of the compiler

Dit is not possible to directly generate code for real machines.

No answer description available for this question. Let us discuss.

View Answer

Discuss

Recursive descent parsing is an example of

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

Recursive descent parsing is an example of

Atop down parsing

Bbottom up parsing

Cpredictive parsing

Dheuristic parsing.

Akilesh Kharvi ? Dec 8 '2016 at 21:45

Answer : top down parsing

Explanation:

One of the most straightforward forms of parsing is recursive descent parsing. This is a top-down process in which the parser attempts to verify that the syntax of the input stream is correct as it is read from left to right.

View Answer

Discuss