[<<][staapl][>>][..]
Fri May 23 19:23:32 CEST 2008

Single assignment base language

So, I'm going full circle. Back to postfix notation with a (set! name
value) component? Is it actually possible to do so? Prefix primitives:

   [ ]       macro composition
   ' <name>  macro variable dereference (+ creation?)
   macro!    single assignment definition
   forth!
   variable!

This would require a separate state machine (that resembles a forth)
to run during the preprocessing step.

This looks like a nice solution, but i cant help to think: why is this
DIFFERENT than the Scat state machine? Can this be written in Scat?
And don't i introduce composition problems again?

A scat machine with state: (stack, in, out) should be able to parse
this without problems.

Now I'm confused.. caffeine poisoning..



[Reply][About]
[<<][staapl][>>][..]