GATE CS 2026 Set 2 — Question 35

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
NAT+1 / -0MediumTokens & LexemesLexical AnalysisCompiler DesignRegular Expressions for Tokens

Compiler Design → Lexical Analysis → Regular Expressions for Tokens

Last updated

Question

A lexical analyzer uses the following token definitions
  • letter[AZaz]letter \to [A-Za-z]
  • digit[09]digit \to [0-9]
  • idletter(letterdigit)id \to letter (letter \mid digit)^*
  • numberdigit+number \to digit^+
  • ws(blanktabnewline)+ws \to (blank \mid tab \mid newline)^+
For the string given below,x123mm78y7zzz514A8HAaYcDx1 \quad 23mm \quad 78 \quad y \quad 7z \quad zz5 \quad 14A \quad 8H \quad AaYcDthe number of tokens (excluding wsws) that will be produced by the lexical analyzer is __________. (answer in integer)
Your answer

Enter a number. Decimals, negative values and scientific notation are accepted.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Lexical Analysis