Parsing with CAs

Grammar rule application is the hardest part of parsing.
Add a small stack of variable binding sites.
Add a mechanism to recognise the top of the stack.
Make the grammar rules right leaning to keep the stack small.
When there are conflicting grammar rules, resolve the conflict by competition between rule CAs. (I have a working model for competition.)
This gives you my Plink parser and that is really close to Marcus' Parisfal.
These are both reasonable symbolic models for parsing.