Re: [TDR] Token-Based Compilers (Patrick C. Beard)
Sat, 23 Jan 1993 01:40:51 GMT

          From comp.compilers

Related articles
[TDR] Token-Based Compilers (1993-01-20)
Re: [TDR] Token-Based Compilers (1993-01-23)
Re: [TDR] Token-Based Compilers (1993-01-25)
P-Code (was Re: [TDR] Token-Based Compilers) (1993-01-26)
Re: [TDR] Token-Based Compilers nigel@socs.uts.EDU.AU (1993-02-01)
| List of all articles for this month |

Newsgroups: comp.compilers
From: (Patrick C. Beard)
Organization: Department of Computer Science, University of California, Davis
Date: Sat, 23 Jan 1993 01:40:51 GMT
References: 93-01-143
Keywords: Pascal, interpreter, comment (Paul Robinson) writes:
>I'd like to ask what people think of the idea of Compilers that generate
>ficticious machine code, i.e. tokens for an optimized machine which is
>then interpreted on the target.

I believe Microsoft uses P-Code in many of its shipping products for the
Macintosh. Microsoft Word has an enormous 'PCOD' resource in it, which I
take to be the result of some kind of cross-platform compilation tool.

I am very interested in finding out what the various trade-offs are in
compiling to pseudo code. And what type of instructions to provide. I am
thinking very seriously about writing a C interpreter using just such a
technique. Has anybody any references on designs of P-Code instruction

// Patrick C. Beard
// Department of Computer Science, U. C. Davis
[Microsoft has always used p-code for all versions of Word. The p-code
compiler used to be internal only until it was made part of MS C. Current
versions of their C compiler can generate p-code and come with the
interpreter. As you might expect, the p-code is considerably smaller and
slower than native code. -John]

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.