Refactor MI parsing to decrease the number of regex matches to perform

[barisione]

• I have added an entry to CHANGELOG.md

Summary of changes

The previous code to match MI records used to do matches twice. This PR simplifies the code (hopefully!) and means that matches need to happen only once.
Functionally, there should be no changes as I kept the regexes mostly identical and the same checks are executed in the same order.
“Mostly” because tokens used to be matched with (\d*) and are now matched with (\d+)? which I think makes it clearer to readers of the code that tokens are optional.

Test plan

Tested by running

nox -s tests

[cs01]

NIce, this is much better!

Should we consider writing a grammar to simplify this more? Someone did this in rust for pygdbmi -- https://github.com/JP3BGY/gdbmi/blob/master/src/gdbmi_output.pest

We could use lark which has implementation in other languages for the same source .lark grammar.

• https://github.com/lark-parser/lark
• https://lark-parser.readthedocs.io/en/latest/json_tutorial.html
• https://www.lark-parser.org/ide/#
• https://www.lark-parser.org/Lark.js/index.html

[barisione]

Should we consider writing a grammar to simplify this more? Someone did this in rust for pygdbmi -- https://github.com/JP3BGY/gdbmi/blob/master/src/gdbmi_output.pest

Good idea. I opened #75.