Related articles |
---|
Dynamic Language (grammar) pohanl@my-deja.com (2000-07-31) |
Re: Dynamic Language (grammar) mcr@demon.co.uk (Martin Rodgers) (2000-08-04) |
Re: Dynamic Language (grammar) jimbo@radiks.net (2000-08-04) |
Re: Dynamic Language (grammar) mcr@wildcard.demon.co.uk (Martin Rodgers) (2000-08-05) |
Re: Dynamic Language (grammar) mcr@wildcard.demon.co.uk (Martin Rodgers) (2000-08-05) |
Re: Dynamic Language (grammar) mcr@wildcard.demon.co.uk (Martin Rodgers) (2000-08-10) |
Re: Dynamic Language (grammar) koontz@ariolimax.com (David G. Koontz) (2000-08-10) |
Re: Dynamic Language (grammar) mcr@wildcard.demon.co.uk (Martin Rodgers) (2000-08-14) |
From: | Martin Rodgers <mcr@demon.co.uk> |
Newsgroups: | comp.compilers |
Date: | 4 Aug 2000 15:51:28 -0400 |
Organization: | The Wildcard Killer Butterfly Breeding Ground |
References: | 00-07-094 |
Keywords: | syntax, design, comment |
Voice in the desert: Quiet, isn't it, pohanl@my-deja.com?
> But have you noticed something? All the languages in the world has a
> fixed grammar. The only one that comes close to being dynamic is
> Lisp. But even in lisp you must follow the recursive syntax, and you
> are bound to it for creating new functions.
I see three stages of language; things, ideas and language.
Things are what the machine itself understands. Registers, memory, and
instructions for altering machine state.
Ideas are procedure and data abstractions. Code units, data types,
their construction and combination. Abstract representations of
machine state and transitions.
Language is how we talk about everything.
> Well, I happen to have created a new language with a dynamic grammar
> tree.
Note how this is done in Lisp and Forth.
http://www-mitpress.mit.edu/sicp/
http://www.forth.com/Content/History/History1.htm
--
[Also see tcl, same idea. -John]
Return to the
comp.compilers page.
Search the
comp.compilers archives again.