From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-0.8 required=5.0 tests=BAYES_00,INVALID_DATE
	autolearn=no autolearn_force=no version=3.4.4
Path: utzoo!attcan!uunet!lll-winken!ames!pasteur!ucbvax!skvax1.csc.ti.com!linnig
From: linnig@skvax1.csc.ti.com
Newsgroups: comp.lang.ada
Subject: Goto and simulating processors
Message-ID: <8901182220.AA10372@ti.com>
Date: 18 Jan 89 22:16:01 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Organization: The Internet
List-Id: <comp.lang.ada>

> billwolf@hubcap.clemson.edu writes:
> From a recent article by blakemor@software.ORG.UUCP (Alex Blakemore):
> >    According to John Barnes [Programming in Ada p. 61]
> >      "The main reason concerns automatically generated programs ...
> >      [to] transliterate (by hand or machine) a program from some other
> >      language into Ada"
>    From what I've heard, as recently as October's Tri-Ada '88,
>    automatic translation is pretty well discredited as a software
>    porting technique.  

You might want to SIMULATE the execution of a microcode processor by
translating the microcode into Ada. The compiled Ada code would execute
much faster than it would if you interpreted the microcode each line at
runtime. Such simulated execution could be combined with the Ada code for
the controlling scalar processor to simulate the entire system. If the
microcode contained GOTO's, then the microcode GOTO could be translated
directly to an Ada GOTO.

Such a simulation would also be easy to port to another machine (assuming
an Ada compiler existed on that machine).


	Mike Linnig,
	Texas Instruments