Module parser 

The parser. Turns LaTeX math strings into EqNode trees.

The main entry point is parse_equation. For standalone symbol lookup, use latex_to_unicode.

The parser is a hand-written recursive descent parser over a Vec<char>. It never fails — malformed input produces a best-effort tree rather than an error. This keeps live-preview editors responsive while the user types.

Structs

EqParser

Constants

BIG_OP_COMMANDS

Functions

big_op_symbol

is_big_op

latex_to_unicode

Look up the Unicode character for a LaTeX command name.

parse_equation

Parse a LaTeX math string into an EqNode tree.