Tokens MCQ Quiz in मराठी - Objective Question with Answer for Tokens - मोफत PDF डाउनलोड करा

The first phase of compiler is called lexical analysis or scanning. The lexical analyzer reads the stream of characters making up the source program and groups the characters into meaningful sequence called lexemes.

For each lexeme, the lexical analyzer produces as output a token of the form that it passes on to the subsequent phase, syntax analysis.

Tokens in given statement:

Therefore, there are 8 tokens

Phases in a compiler:

The correct answer: A → 2, B → 3, C  → 4, D  → 1.

Important Point:

A parse tree is also called syntax tree

Three address code is one of the intermediate representation.

tokens are

1. printf

2. (

3. “Hello”

4. )

5. ;

A token is a sequence of characters that can be treated as a single logical entity. C tokens are the basic building blocks in C language which are constructed together to write a C program.

●  Each and every smallest individual unit in a C program are known as C tokens.

●  C tokens are of six types. They are,

1.Keywords                 (eg: int, while),

2.Identifiers                 (eg: main, total, MAX),

3.Constants                 (eg: 10, 20, 1.02e+2),

4.Strings                      (eg: “total”, “hello”, "Testbook"),

5.Special symbols       (eg: (), {}),

6.Operators                 (eg: +, /,-,*)

#define is C Preprocessor, which is not part of the compiler but is a separate step in the compilation process. So it is not a token.

• The first phase of compiler is called lexical analysis or scanning. The lexical analyzer reads the stream of characters making up the source program and groups the characters into meaningful sequence called lexemes. For each lexeme, the lexical analyzer produces as output a token of the form that it passes on to the subsequent phase, syntax analysis.
• Tokens may be of the form of identifiers, keywords, constants etc. from the input program.

All operators are token

a /= 2 

a = a/2

Therefore option all option are correct

• Lexical analysis is the process of converting a sequence of characters into a sequence of tokens. A token can be a keyword. Therefore, keyword of a language is determined during lexical analysis of the program and output of a lexical analyzer is tokens
• Type checking is done at semantic analysis phase and parsing is done at syntax analysis phase.

Total Number of tokens = 5 + 5 + 11 = 21

Notes:

| is used to separate the token

The correct answer is option 3 i.e. Both S1 and S2.

A lexical analyzer creates a symbol-table entry as soon as it sees the characters that make up a lexeme. Also, it detects ill-formed numeric literals and input characters that are not in the source language.​​

The correct answer is option 3.

Concept:

A lexical token is a sequence of characters that can be treated as a unit in the grammar of the programming languages.

Example of tokens:

Type token (id, number, real, . . . )

Punctuation tokens (IF, void, return, . . . )

Alphabetic tokens (keywords)

Explanation:

printf ("i = %d, j = %f, &i = %x\n", i, j, &i);

Hence the correct answer is 12.

Total Number of tokens = 5 + 5 + 11 = 21

Notes:

| is used to separate the token