Skip to content

Milestones

List view

  • Implement the Control, Stack, and Environment (CSE) machine to evaluate the Standardized Tree. This milestone brings the interpreter to life, allowing it to correctly process the ST and produce the final, expected output of the RPAL programs.

    Overdue by 2 month(s)
    Due by May 15, 2026
    1/1 issues closed
  • Traverse the Abstract Syntax Tree (AST) and apply specific transformation rules to convert it into a Standardized Tree (ST). This step simplifies the tree structure, resolving complex syntactic sugar into simpler, fundamental operations ready for evaluation.

    Overdue by 2 month(s)
    Due by May 11, 2026
  • Implement the parser to validate the token stream against the RPAL Phrase Structure Grammar. The final deliverable for this milestone is a working parser that outputs a correct Abstract Syntax Tree (AST) representing the hierarchical structure of the input program.

    Overdue by 3 month(s)
    Due by May 6, 2026
  • Build the foundational scanner to read RPAL source code and convert it into a stream of tokens. This involves identifying keywords, strings, integers, operators, and punctuation according to the RPAL lexical rules without relying on external libraries

    Overdue by 3 month(s)
    Due by May 2, 2026