Re: [stack] impure concatenativity: let without translation

>>
>> Why cant we build a tree of tokens (first pass) and work with the
>> tree?
>
> We can.
>
>> ie, once we assure that the quotes are balanced, it resolves into a
>> pure
>> expression tree (same as a prefix-lang) right?
>
> Yes, but I don't see how that helps with the five issues I mentioned.

| 1. It is necessary to run the program in order to get the
| definitions. This is obviously massively complicates, well, everything
| really.

Once you have an expression tree, you are no longer waiting for the symbol
name to bind to .

| 2. Type checking is awkward as you run into errors in the definition
| before you know what the definition will be named. Error reporting
| becomes more difficult.

See above. You can check the wellformed-ness of the code during tree  
creation,
once the tree is created, you know the symbol name to bind to, any further
error reporting can make use of the symbol that you have at the root.

| 3. There's no way to introduce recursive definitions as the recursive
| call needs to be resolved before the name of the function is known.

| 4. Tool support is largely out the window.

| 5. You can't ensure that type checking or compilation will ever
| terminate.

see above, once the expression tree is created, there is n't any difference
in what you can do with prefix and postfix notation.

i.e. 'sum(sum(1,2),3)' and  '1 2 sum 3 sum' will yield the same tree,

sum - 3
  |- sum - 2
     |- 1

so what am I missing?


------------------------------------

Yahoo! Groups Links

<*> To visit your group on the web, go to:
    http://groups.yahoo.com/group/concatenative/

<*> Your email settings:
    Individual Email | Traditional

<*> To change settings online go to:
    http://groups.yahoo.com/group/concatenative/join
    (Yahoo! ID required)

<*> To change settings via email:
    mailto:[email protected] 
    mailto:[email protected]

<*> To unsubscribe from this group, send an email to:
    [email protected]

<*> Your use of Yahoo! Groups is subject to:
    http://docs.yahoo.com/info/terms/