1-You have machine M, and executable binaries for a C->M host compiler. You also have C source for Pascal->C compiler. Show what you have with tombstone diagrams

2-You write an application Prj in C. Show all steps until generative execution. Show what you have with tombstone diagrams

3-Redo showing all steps for interpretive execution (note you dont have an interpreter yet). Show what you have with tombstone diagrams

4-You then write the same application in Pascal. Show all that is needed for any execution. Show what you have with tombstone diagrams

5-After doing the above, you need to run both projects on small-resource machine N. Assuming that N is too small to run any translators, what you do? Show what you have with tombstone diagrams.

6-Now your N is larger (maybe you bought more memory) and you can now start running compilation on N, and you want to implement a compiler somehow rather than buy (maybe no one sells compilers for N), what you do? Show what you have with tombstone diagrams.

7-In the example in the notes, the Pascal execution environment was improved by implementing PCode->M compiler. But the Pascal->PCode compiler could be changed to compile directly into M instead. Assume this is the approach, show what is modified, how compiled, and explain what can be improved this way. Show what you have with tombstone diagrams