Look into other parser options

[Vlek]

Problem:
Pyparsing states that the usual method for parsing statements is with the Lex/Yacc method. This may have the potential for a speed increase, even with the pure-python implementation PLY.

Solution:
Research this method, attempt to create a small prototype and try it on ((((((((((1 + 1)))))))))) to see whether it's quicker. If this is determined to be meaningfully faster, then switch over to using it.

Considerations:

• Will this really be a meaningful speed increase? Will have to ensure that this is worthwhile in Add speed metric tests #41
• We are already considering using the new python pattern matching notation in Change parser to new Structural Pattern Matching Spec #35, will this be faster?

[Vlek]

I have done some research into the speed ramifications and this is our biggest bottleneck in terms of the actual code running. Right now, pyparsing is by far the biggest expense that we have. In addition to resolving some of the issues we may be facing with parsing, it may be helpful for speed to also consider another parser.

[Vlek]

I have done some research into the speed ramifications and this is our biggest bottleneck in terms of the actual code running. Right now, pyparsing is by far the biggest expense that we have. In addition to resolving some of the issues we may be facing with parsing, it may be helpful for speed to also consider another parser.