Page MenuHomePhabricator

Ratscript: Math parser
Open, p3: NextPublic

Description

(rewritten from primitive understanding of the lexer/scanner situation)

Take tokens generated by the Lexer and interpret/parse them for math patterns.

Function should recursively separate into one of these patterns until no matches remain:

math, operator, math
(math, operator, math)
function result, operator, math
math, operator, function result
(function result, operator, math)
(math, operator, function result)

and create an appropriate tree with the relative positions of each token (number, operator, parenthesis).

Details

Task Type
Feature
Proposed Urgency
Established
Gravity
g5: Critical
Friction
f4: Trail
Relativity
r2: Low
Volatility (Caught At)
Not a Bug
Origin
Not a Bug/Unknown

Event Timeline

ardunster triaged this task as p3: Next priority.Nov 11 2020, 3:52 PM
ardunster created this task.

The work in D383 didn't directly address this, and in following the pattern of Lox, it isn't the Lexer's job to discern patterns, that happens at the next step of interpretation. (Parsing?)

jcmcdonald moved this task from Restricted Project Column to Backlog on the Ratscript [Project] board.Jun 19 2021, 9:52 AM
jcmcdonald edited projects, added Ratscript [Project]; removed Unknown Object (Project).