Rewrite Tree Node Stream Design
Working on design for tree grammar rewriting. I want to be able to tweak a tree w/o having to rebuild whole tree. Imagine a : (A B c D) ; c : C > E F ; which means replace the C with E F ... Other labels:
trees, translators
Token stream rewriting with rewrite rules
Let's talk tree and token stream rewriting. Starting with simple token rewriting. I've thought about this and I think we can fold rewriting patterns into grammar composition and token stream stuff. Here's a simple rule that just replaces ... Other labels:
tokens, channels