Two finite state machines are said to be equivalent only if
Two finite state machines are said to be equivalent only if they
Two finite state machines are said to be equivalent only if they
Which statement most closely describes the regular expression 01 * 0 ?
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.
All compilers are designed to be
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.
Generation of intermediate code based on an abstract machine model is useful in compilers because
Recursive descent parsing is an example of
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.
Compiler Design, Computer Organization Architecture, Operating System, PGCET CSE Exam (Karnataka) 2011, UnSolved
In an absolute loading scheme, the assembler, in addition to its normal functions, should also perform
In a time sharing system, a process which is currently running, completed its allocated time slot. It now enters the
Akilesh Kharvi ? Dec 8 '2016 at 21:42
Answer: ready state
Explanation:
After completion of allocated time slot, process enters into the ready state.