Test Parser Code for ::SHE+ILA:: [$6E]

More about Test Parser Code for ::SHE+ILA:: [$6E]

Parser <:: { (input=%, tree=(), subtree=(), token1, token2, token3 ); {* #input : // repeat while input isn't empty
{ input => token1; {(), subtree <:: Parser(input);} [1+(token1 == "(")]; // Open parenthesis, so do recursive descent
{input => token2 => token3; // Pop from head of input
{(), {tree << (token1, token2, subtree)}}[1 + (isOperand(token1) /\ isOperator(token2) /\ #subtree)]; // Dyadic with subtree
{(), {tree << (token1, token2, token3)}}[1+ (isOperand(token1) /\ isOperator(token2) /\ isOperand(token3)]; // Dyadic operator
// Note we put back token3 if not used below
{(), {tree << (token1, token2); input < token3}}[1+ (isOperator(token1) /\ isOperand(token2)]; // Monadic operator
// More stuff here, for example we need to do PEMDAS priorities, parentheses, semicolons, and vectors
*} // End loop when no more input
tree} // The function returns the parse tree :)