1.1 Consider the following program segment: while (y...

 

Transcribed Image Text:

1.1 Consider the following program segment: while (y <z) { int x=a+b; y+ x;} 1.1.1 Create the tokens returned by the lexical analyzer. 1.1.2 Show with a drawing the parse tree representation. 1.1.3 Perform the semantic analysis. 1.1.4 Generate an intermediate code. 1.1.5 Optimize your code. [4] [5] [3] [4] [4] 1.1 Consider the following program segment: while (y <z) { int x=a+b; y+ x;} 1.1.1 Create the tokens returned by the lexical analyzer. 1.1.2 Show with a drawing the parse tree representation. 1.1.3 Perform the semantic analysis. 1.1.4 Generate an intermediate code. 1.1.5 Optimize your code. [4] [5] [3] [4] [4]