Register

Recent questions tagged ullman

3 votes
1 answer
96
Ullman (Compiler Design) Edition 2 Exercise 3.3 Question 3 (Page No. 125)
In a string of length $n$, how many of the following are there? Prefixes. Suffixes. Proper prefixes. Substrings. Subsequences.
In a string of length $n$, how many of the following are there? Prefixes. Suffixes. Proper prefixes. Substrings. Subsequences.
User Avatar
0 votes
1 answer
101
Ullman (Compiler Design) Edition 2 Exercise 2.8 Question 2 (Page No. 105)
The programming language C does not have a boolean type. Show how a C compiler might translate an if-statement into three-address code.
The programming language C does not have a boolean type. Show how a C compiler might translate an if-statement into three-address code.
User Avatar
0 votes
0 answers
103
Ullman (Compiler Design) Edition 2 Exercise 2.6 Question 3 (Page No. 85)
Extend the lexical analyzer in Section $2.6.5$ to recognize floating point numbers such as $2. , 3.14$, and $.5$.
Extend the lexical analyzer in Section $2.6.5$ to recognize floating point numbers such as $2. , 3.14$, and $.5$.
User Avatar
0 votes
0 answers
104
Ullman (Compiler Design) Edition 2 Exercise 2.6 Question 2 (Page No. 85)
Extend the lexical analyzer in Section $2.6.5$ to recognize the relational operators $<, <=, ==, !=, >=, >$.
Extend the lexical analyzer in Section $2.6.5$ to recognize the relational operators $<, <=, ==, !=, >=, >$.
User Avatar
0 votes
1 answer
106
Ullman (Compiler Design) Edition 2 Exercise 2.4 Question 1 (Page No. 68)
Construct recursive-descent parsers, starting with the following grammars: $S\rightarrow +SS \mid -SS \mid a$ $S\rightarrow S(S)S \mid \epsilon$ $S\rightarrow 0S1 \mid 01$
Construct recursive-descent parsers, starting with the following grammars:$S\rightarrow +SS \mid -SS \mid a$$S\rightarrow S(S)S \mid \epsilon$$S\rightarrow 0S1 \mid 01$
User Avatar
0 votes
0 answers
107
Ullman (Compiler Design) Edition 2 Exercise 2.3 Question 5 (Page No. 60)
Construct a syntax-directed translation scheme that translates postfix arithmetic expressions into equivalent infix arithmetic expressions.
Construct a syntax-directed translation scheme that translates postfix arithmetic expressions into equivalent infix arithmetic expressions.
User Avatar
1 votes
0 answers
110
Ullman (Compiler Design) Edition 2 Exercise 2.3 Question 2 (Page No. 60)
Construct a syntax-directed translation scheme that translates arithmetic expressions from postfix notation into infix notation. Give annotated parse trees for the inputs $95-2*$ and $952*-$.
Construct a syntax-directed translation scheme that translates arithmetic expressions from postfix notation into infix notation. Give annotated parse trees for the inputs...
User Avatar
0 votes
1 answer
118
Ullman (Compiler Design) Edition 2 Exercise 1.6 Question 4 (Page No. 36)
What is printed by the following C code? #define a (x+1) int x = 2; void b() {x = a; printf("%d\n",x);} void c() {int x = 1; printf("%d\n"),a;} void main() {b(); c();}
What is printed by the following C code?#define a (x+1) int x = 2; void b() {x = a; printf("%d\n",x);} void c() {int x = 1; printf("%d\n"),a;} void main() {b(); c();}
User Avatar
0 votes
0 answers
120
Ullman (Compiler Design) Edition 2 Exercise 1.6 Question 2 (Page No. 35 - 36)
For the block-structured C code, indicate the values assigned to $w,x,y$ and $z$. int w,x,y,z; int i = 3; int j = 4; { int i = 5; w = i + j; } x = i + j; { int j = 6; i = 7; y = i + j; } z = i + j;
For the block-structured C code, indicate the values assigned to $w,x,y$ and $z$.int w,x,y,z; int i = 3; int j = 4; { int i = 5; w = i + j; } x = i + j; { int j = 6; i =...
User Avatar
Page: