Talk:Compile and go system
Appearance
![]() | This article was nominated for deletion on 20 March 2012 (UTC). The result of the discussion was nomination withdrawn. |
![]() | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||
|
If it's "compile and go", isn't it a compiler?
[edit]Peter Flass (talk) 00:10, 29 March 2012 (UTC)
"easier to implement"
[edit]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)