Register

UGC NET CSE | June 2008 | Part 2 | Question: 33

Redirected
• edited by
139 views
0 votes
0 votes

At the end of parsing,

  1. tokens are identified.
  2. set of instructions are identified.
  3. the syntactic groups are identified.
  4. machine instructions are identified.

     

• edited by
User Avatar

1 Answer

0 votes
0 votes
It definitely answer is A tokens is generated
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
2
admin asked Jan 6
91 views
UGC NET CSE | June 2008 | Part 2 | Question: 2
The complexity of Kruskal's minimum spanning tree algorithm on a graph with ' $n$ ' nodes and ' $e$ ' edges is : $\mathrm{O}(n)$ $\mathrm{O}(n \log n)$ $\mathrm{O}(e \log n)$ $\mathrm{O}(e)$
The complexity of Kruskal's minimum spanning tree algorithm on a graph with ' $n$ ' nodes and ' $e$ ' edges is :$\mathrm{O}(n)$$\mathrm{O}(n \log n)$$\mathrm{O}(e \log n)...
User Avatar
0 votes
0 votes
1 answer
3
admin asked Jan 6
99 views
UGC NET CSE | June 2008 | Part 2 | Question: 3
If a code is t-error correcting, the minimum Hamming distance is equal to : $2 t+1$ $2 t$ $2 t-1$ $t-1$
If a code is t-error correcting, the minimum Hamming distance is equal to :$2 t+1$$2 t$$2 t-1$$t-1$
User Avatar
0 votes
0 votes
3 answers
4
admin asked Jan 6
261 views
UGC NET CSE | June 2008 | Part 2 | Question: 4
The set of positive integers under the operation of ordinary multiplication is : not a monoid not a group a group an Abelian group
The set of positive integers under the operation of ordinary multiplication is :not a monoidnot a groupa groupan Abelian group
User Avatar
Link Copied!