[austincheney]

I created a parsing scheme to address a variety of static analysis concern. https://sparser.io/

You don't have to use the parser libraries I provide. The important thing about a tool like that is the data structure is provides.

Here are some key benefits:

1. The output is table that can be used as a tree. Each parsed token knows what its parent is and where the containing parent ends which allows for walking the tree in an algorithmic fashion.

2. Since the output is a table of arrays it is the fastest non-bytecode parsing scheme to access.

3. The output structure is language agnostic, so provided a proper parser it can represent any language, any combination of languages, and any combination of languages in a nested fashion.