Computer Science · Compiler Design
दिए गए इनपुट एक्सप्रेशन x = y+++z; में जहाँ '+' और '++' दोनों वैध ऑपरेटर हैं, एक लेक्सिकल एनालाइज़र (lexical analyzer) मैक्सिमल मंच नियम का उपयोग करके इस एक्सप्रेशन को कैसे टोकनाइज़ करता है?
- 1y, +, +, +, z
- 2y, ++, +, z✓
- 3लेक्सिकल त्रुटि (Lexical error)
- 4y, +, ++, z
सही उत्तर देखें
y, ++, +, z
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length Computer Science mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Compiler Design?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Compiler Design