Lexical Analysis

char *str1 = "Hello;    /* Statement S1 */
char *str2 = "Hello;";  /* Statement S2 */
int *str3 = "Hello";    /* Statement S3 */

One or more correct

• AS1 and S2 have syntactic errors
• BS2 has a lexical error and S3 has a syntactic error
• CS1 has a lexical error and S3 has a semantic error
• DS1 has a syntactic error and S3 has a semantic error

Numerical answer

Set X                               Set Y
P. Lexical Analyzer                 1. Abstract Syntax Tree
Q. Syntax Analyzer                  2. Token
R. Intermediate Code Generator      3. Parse Tree
S. Code Optimizer                   4. Constant Folding

Single correct

• AP – 4; Q – 1; R – 3; S – 2
• BP – 2; Q – 3; R – 1; S – 4
• CP – 2; Q – 1; R – 3; S – 4
• DP – 4; Q – 3; R – 2; S – 1

letter → [A-Za-z]
digit  → [0-9]
id     → letter (letter | digit)*

Single correct

• AAutomaton (A) in the figure
• BAutomaton (B) in the figure
• CAutomaton (C) in the figure
• DAutomaton (D) in the figure

Answer key coming soon

int main() {
    Integer x;
    return 0;
}

Single correct

• ALexical analyzer
• BSyntax analyzer
• CSemantic analyzer
• DMachine dependent optimizer

Answer key coming soon

Single correct

• AI only
• BI and III only
• CII only
• DNone of I, II, and III

Answer key coming soon

Single correct

• A$T_1T_2T_3$
• B$T_1T_1T_3$
• C$T_2T_1T_3$
• D$T_3T_3$

Single correct

• Aparsing of the program
• Bthe code generation
• Cthe lexical analysis of the program
• Ddataflow analysis

Answer key coming soon

Single correct

• AFinite state automata
• BDeterministic pushdown automata
• CNon-deterministic pushdown automata
• DTuring machine

Answer key coming soon