Disclosed herein is a compiler parsing technique that makes use of a “card game” mechanic to parse through tokens and generate an output that is inserted into a tree data structure and processed bottom-up. The technique is a non-recursive a parser & lexer. The processing is less computationally expensive than prior, recursive methods such as top down operator precedence. Simpler embodiments employ card solving of simple formulas, and more advanced embodiments implement tree processing structures that implement a card solver parsing technique at each node (or a subset of nodes) of the tree processing structures. In some embodiments, different nodes of a tree processing structure are routed to different processors (e.g., a CPU or a GPU) based on the degree of parallelism available in each node in order to improve parsing, compute, evaluation and compiling times.