Q. The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?

(A) Finite state automata
(B) Deterministic pushdown automata
(C) Non-Deterministic pushdown automata
(D) Turing Machine

💬 Discuss

✅ Correct Answer: (A) Finite state automata

Published by Mr. Dubey ⭐ 111.54K Points at 19-Sep-2023 08:44 pm in Theory of Computation and Compiler Design

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

1029

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

99%

Success Rate