🔍
Consider the following statements related to compiler construction: I. Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. II. Syntax Analysis is specified by regular expressions and implemented by finite-state machine. Which of the above statement(s) is/are correct? (1) Only l (2) Only ll (3) Both I and II (4) Neither I nor Il
0 like 0 dislike

1 Answer

Answer: 4
0 like 0 dislike

Related questions

Which of the following statement(s) regarding a linker software is/are true? I. A function of a linker is to combine several object modules into a single load module. II. A function of a linker is to replace absolute ... modules. (1) Only I (2) Only II (3) Both I and II (4) Neither I nor Il
Answer : Answer: 1...

View solution
0 like 0 dislike
1 answer

Which of the following statement(s) with regard to an abstract class in JAVA is/are TRUE? I. An abstract class is one that is not used to create objects. II. An abstract class is designed only to act as a base class ... by other classes. (1) Only l (2) Only II (3) Neither I nor II (4) Both l and II
Answer : Both l and II...

View solution
0 like 0 dislike
1 answer

Abstraction and encapsulation are fundamental principles that underlie the object oriented approach to software development. What can you say about the following two statements? I. Abstraction allows us to focus on what something ... and II are correct. (3) Only II is correct. (4) Only I is correct.
Answer : (1) Neither I nor II is correct....

View solution
0 like 0 dislike
1 answer

Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes. (A) 2 (B) 4 (C) 5 (D) 6
Answer : (D) 6...

View solution
0 like 0 dislike
1 answer

Which of the following pairs have different expressive power? (1) Single-tape-turing machine and multi-dimensional turing machine. (2) Multi-tape turing machine and multi-dimensional ... non-deterministic pushdown automata. (4) Deterministic finite automata and Non-deterministic finite automata.
Answer : Deterministic push down automata and non-deterministic pushdown automata....

View solution
0 like 0 dislike
1 answer

50.5k questions

47.1k answers

240 comments

7.0k users