Related articles |
---|
Language Design 81282ed9a88799d21e77957df2d84bd6514d9af6@myhashism (Billy Mays) (2011-07-18) |
Re: Language Design usenet@rwaltman.com (Roberto Waltman) (2011-07-18) |
Re: Language Design sinu.nayak2001@gmail.com (Srinivas Nayak) (2011-07-18) |
Re: Language Design anton@mips.complang.tuwien.ac.at (2011-07-19) |
Re: Language Design zwinkau@kit.edu (Andreas Zwinkau) (2011-07-20) |
Re: Language Design acolvin@efunct.com (mac) (2011-07-23) |
Re: Language Design christophe.de.dinechin@gmail.com (Christophe de Dinechin) (2011-07-23) |
Re: Language Design osesov@gmail.com (Oleg Sesov) (2011-07-23) |
Re: Language Design gene.ressler@gmail.com (Gene) (2011-07-26) |
Re: Language Design thomas.mertes@gmx.at (tm) (2011-07-27) |
[4 later articles] |
From: | anton@mips.complang.tuwien.ac.at (Anton Ertl) |
Newsgroups: | comp.compilers |
Date: | Tue, 19 Jul 2011 13:12:39 GMT |
Organization: | Institut fuer Computersprachen, Technische Universitaet Wien |
References: | 11-07-027 |
Keywords: | design |
Posted-Date: | 23 Jul 2011 02:38:15 EDT |
Billy Mays <81282ed9a88799d21e77957df2d84bd6514d9af6@myhashismyemail.com> writes:
>I am trying to design a programming language for a simple processor
>(16 bit, ~10 instructions, 16 registers). I am not sure what a
>language actually needs in order to be more useful than pure assembly,
>but is also reasonable to implement.
>
>I had originally tried to make a RPN style language where the language
>is purely stack based, but I realized it wouldn't be Turing complete.
Why not. Anyway, you can implement Forth or something similar, which
is Turing-complete and relatively easy to implement.
- anton
--
M. Anton Ertl
anton@mips.complang.tuwien.ac.at
http://www.complang.tuwien.ac.at/anton/
Return to the
comp.compilers page.
Search the
comp.compilers archives again.