Register

GO Classes DPP | COMPILER| LEXICAL ANALYSIS

319 views

2 Answers

1 1 vote
1. scanf
2. (
3. "\%d \%f" (string literal - 1 token)
4. ,
5. &
6. num
7.,
8. &
9. value
10. )
11. ;

Count = 11
Voting & Accepting an answer helps improve the community
Answer:
← Previous · GO Classes DPP | COM...Next → · GO Classes DPP | COM...
← Previous in category · GO Classes DPP | COM...Next in category → · GO Classes DPP | COM...
Position:
Show:

Related questions

2 2 votes
2 2 answers
327
327 views
GO Classes asked Nov 29, 2025
327 views
GO Classes DPP | COMPILER|LEXICAL ANALYSIS
The number of tokens in the following C statement is $\_\_\_\_$for(int k=0; k<MAX; k++) { sum += data[k];} 
1 1 vote
3 3 answers
327
327 views
GO Classes asked Nov 29, 2025
327 views
GO Classes DPP | COMPILER | SDT
Consider the following grammar with semantic actions inside braces:$S \rightarrow a A \quad$ {print "1"} $S \rightarrow b \quad$ {print " 2 " } $A \rightarrow S b \quad$ ...
2 2 votes
3 3 answers
443
443 views
GO Classes asked Nov 29, 2025
443 views
GO Classes DPP | COMPILER | OPERATOR PRECEDENCE
Given the following expression grammar:$$\begin{gathered}E \rightarrow E+T|T * E| T \\T \rightarrow T / F \mid F \\F \rightarrow \mathrm{id}\end{gathered}$$Which of the f...
1 1 vote
2 2 answers
302
302 views
GO Classes asked Nov 29, 2025
302 views
GO Classes DPP | COMPILER | SDT
A shift-reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of the grammar:$A \rightarrow a B \quad$ {pri...