15
The lexical analysis of various modern computer languages like Java requires the power of which of these machine models
ina sufficient and necessary sense?
EXPLANATION
Compiler Design Phases
- Automata Theory in Compiler Construction:
- In modern programming languages (such as Java, C++, Python), tokens (identifiers, keywords, integer/float literals, operators) are specified via regular expressions.
- The necessary and sufficient theoretical machine model to recognize and tokenize regular languages is the Finite State Automata (FSA) (Deterministic or Non-Deterministic Finite Automata).
- Context-free syntax parsing requires Pushdown Automata, but lexical analysis requires only an FSA.
- Conclusion: Finite State Automata (Option 4).
Correct option: (4) Finite State Automata
Explanation not matching this question?
क्या व्याख्या इस प्रश्न से मेल नहीं खा रही?
Report
Want to practice this paper in exam conditions?
क्या आप परीक्षा जैसे माहौल में अभ्यास करना चाहते हैं?
Test yourself in 5-question batch format with timer and hidden answers.
5-प्रश्नों के बैच फॉर्मैट, टाइमर और छिपे उत्तरों के साथ खुद को परखें।
Start Practice Mode →
प्रैक्टिस टेस्ट मोड शुरू करें →