fernando/thp-lang.org
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

feat: improve expression grammar

Browse Source
This commit is contained in:
Araozu 2024-11-02 21:45:38 -05:00
parent 71de3bd598
commit 1783097ba9
1 changed files with 20 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

25
src/pages/spec/ast/expression.md
View File

@ -9,9 +9,10 @@ The expression parser effectively implements a precedence table.
| Operator | Precedence |
|------------|------------|
| == != | 4 |
| > >= < <= | 3 |
| - + ++ | 2 |
| == != | 5 |
| > >= < <= | 4 |
| - + ++ | 3 |
| . ?. !. | 2 |
| / * % | 1 |
@ -22,9 +23,23 @@ Expression = Equality
Equality = Comparison, (("==" | "!="), Comparison)*
Comparison = Term, ((">" | ">=" | "<" | "<="), Term)*
Term = Factor, (("-" | "+" | "++"), Factor)*
Factor = Unary, (("/" | "*" | "%"), Unary)*
Factor = DotAccess, (("/" | "*" | "%"), DotAccess)*
DotAccess = Unary, (("."), Unary)*
Unary = ("!" | "-"), Expression
| FunctionCallExpression
| CallExpression
```
## CallExpression
It's so hard to properly name these constructions.
This one groups a function call or an array access.
```ebnf
CallExpression = primary, "(", (arguments list)?, ")"
| primary, "[", (expression, (comma, expression)*, comma?)? "]"
| primary
```