Question: USING TOMBSTONE DIAGRAMS/NOTATION FOR EACH PART PLEASE. Given machine M, executable binaries for a C->M host compiler and the source for Pascal->C compiler in C.
USING TOMBSTONE DIAGRAMS/NOTATION FOR EACH PART PLEASE.
Given machine M, executable binaries for a C->M host compiler and the source for Pascal->C compiler in C.

- You write an application named "Prj" in the programming language C. Show all steps in tombstone notation until generative execution.
- Redo showing all steps for interpretive execution (note you DO NOT have an interpreter yet).
- You then write the same application in Pascal. Show all that is needed for any execution.
- 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 do you do? Show with TOMBSTONE diagrams.
- 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 all steps with TOMBSTONE diagrams.
Pascal -> C M TT C->M Host Compiler Machine Pascal -> C M TT C->M Host Compiler Machine
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
