Currently the relational parser accepts a nested grammar alist and recursively pattern matches on it in order to run. This is likely creating a moderate performance hit (need to measure this).
Instead it would be ideal if we could create a relation by initially feeding in the grammar alist, and remove the pattern matching afterwards completely; essentially moving the computation to 'compile time'.
Currently the relational parser accepts a nested grammar alist and recursively pattern matches on it in order to run. This is likely creating a moderate performance hit (need to measure this).
Instead it would be ideal if we could create a relation by initially feeding in the grammar alist, and remove the pattern matching afterwards completely; essentially moving the computation to 'compile time'.