AST nodes

• branch
• loop
• return
• break
• continue
• call
• operation
• cast
• identifier
• literal

Other components

• default_context

All of these components need extensive testing.

For example

#> "hello \" world" + 3
==================
Expected: string("hello \" world"), whitespace( ), operator(+), number(3)
Got: string("hello \" world" + 3)

Types

• Integer
• Float
• Boolean
• String
• Function
• Null
• List
• Map
• Set

All of these types have to be added to enable the creation of more complex types like structs.

Something like the following

var a, b: int = 0;

Add high priority operators from the specification to the Standard Runtime Environment.

High priority

• #add
• #sub
• #mul
• #div
• #asgn Note: moved from operator to AST node
• #equ

Tested modules are

• is_assignment
• find_matching_block
• find_matching_prt
• get_arg_count
• get_precedence
• is_left_associative
• generate_expression
• generate_declaration
• generate_assignment
• generate_function
• generate_if
• generate_while
• generate_for
• generate_sequence
• optimize_ast
• generate

At the moment the lexer does not support escape codes. This means you are not able to encode double quotes, newlines etc.

Support for loops like for (init; cond; iter) { body } is needed. This loop structure can be broken down into the following subcomponents:

init
loop (cond)
  sequence
    body
    iter

• and
• or
• xor
• neq
• sm
• lg
• sme
• lge
• mod
• pow
• unpl
• unmi
• uninv

Lexer is the correct term for its functionality and it is shorter than 'tokenizer'.