Do you know anyhow about extendsiable compilers? In the book
"Algorithms+[DS...]" Wirth wrote that is _VERY_ impossible (not quite,
but "very"). This time, I develope a compiler, which uses structured
diagrams for syntax analyzing...

Do you know an example of similar approach?

Thanks,

Michael.
________________________________________________________________
Michael I. Trofimov
Russian Academy of Sci. Moscow, Russia
email: mtrofimov@glas.apc.orghttp://www.glasnet.ru/~mtrofimov/
[Extensible languages were fashionable in the mid 1970s. It's not
that hard to do, but people found that the ability to write each
program in a slightly different, incompatible, language wasn't all that
useful. -John]
--