Talk:Compile and go system

This article was nominated for deletion on 20 March 2012 (UTC). The result of the discussion was nomination withdrawn.

Computing: Software / CompSci Low‑importance

This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles

Low

This article has been rated as Low-importance on the project's importance scale.

This article is supported by WikiProject Software (assessed as Low-importance).

This article is supported by WikiProject Computer science (assessed as Low-importance).

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

If it's "compile and go", isn't it a compiler?

Latest comment: 12 years ago1 comment1 person in discussion

Peter Flass (talk) 00:10, 29 March 2012 (UTC)Reply

"easier to implement"

Latest comment: 11 years ago1 comment1 person in discussion

A reference would be nice, but IMHO this is so because typically such systems do no optimization, and are usually implemented via threaded code and may consist mostly of "glue" between subroutines. (unsigned contribution by User:Peter Flass 2013-01-20T09:44:05)

Agreed that they typically don't optimize (since programs aren't expected to run for long). Theaded code is one possible implementation, but if I remember correctly, the original Dartmouth Basic (on the GE-635) compiled to machine language. The language of course was pretty simple to compile. --Macrakis (talk) 16:44, 20 January 2013 (UTC)Reply

Add topic