Module expressions 

Precedence-climbing expression parser.

Expressions are parsed via a hand-written recursive-descent chain that encodes operator precedence through the call stack. From lowest to highest:

parse_expression        (entry point, delegates to equality)
  |- parse_logical      (and or)
     |- parse_equality     (== !=)
         |- parse_comparison  (< <= > >= += -= *= /=)
              |- parse_term   (+ -)
                   |- parse_factor  (* /)
                        |- parse_unary   (! -)
                             |- parse_primary  (literals, identifiers, calls, lambdas, …)
                                  |- parse_postfix  (. method chains)

Every function returns an [Expression] node with its source [Span] set to the full extent of the sub-expression it consumed.

Modules

comparsion 🔒

equality 🔒

factor 🔒

logical 🔒

postfix 🔒

primary 🔒

struct_literal 🔒

Record (struct) literal parser: Name { field: value, ... }.

term 🔒

unary 🔒