Expand description
Language frontends. Each parses its own syntax into the shared IR.
Modules§
- apl
- APL frontend: lexer and parser, lowering to the shared IR.
- j
- J frontend: lexer and the sentence parser, lowering to the shared IR.
Structs§
- Dialect
- Dialect settings supplied by the host.
- Rules
- A dialect resolved against a language: what the parser and the engine read. Copyable, and carried by every evaluation context, so a rule that only bites at run time (the index origin a key answers with, the order a grade puts complex values in) reads the same setting the parser did.
- Source
Parts - A source text with interpolation holes split out. Spans in every token
and error refer to
display, where holeireads{name_i}.
Enums§
- Complex
Order - How a grade orders complex values.
- Control
Strictness - How strictly a control structure reads what it is given.
- Default
Arg - When
⍺←vevaluatesv. - Depth
Sign - What monadic
≡answers for an array whose items differ in depth. - DfnResult
- Which sentence of a dfn body is its result.
- Encode
Digits - Whether
⊤reads its digits tolerantly. - First
Disclose - What
↑and⊃mean monadically. - Floor
Rule - How
⌊and⌈read a value that is merely near the integer above or below it. - GcdRule
- Which line’s
∨and∧these are. - Index
Form - What
⌷means. - Inner
Each - Where the each in the inner product’s definition sits.
- Lang
- Lookup
Left - What dyadic
⍳takes on its left. - Near
Count - How a float that is merely NEAR a whole number is admitted where a
count, a length or an index belongs (
⍳2+9E¯11,(2+9E¯11)⍴5). - Nested
Grade - How a grade orders NESTED items.
- Nested
Model - How a nested array holds a simple scalar.
- Partition
- What a dyadic
⊂does. - Segment
Functions§
- compile
- Compile a plain source string (with
{name}holes) in the given language. - compile_
parts - Compile pre-split parts (the t-string path).