ProvableHQ/leo
1
1
Fork 0
mirror of https://github.com/ProvableHQ/leo.git synced 2024-12-25 11:12:48 +03:00
Code Issues Packages Projects Releases Wiki Activity

tentative parse expression grammar rule

Browse Source
This commit is contained in:
gluax 2021-03-24 13:54:53 -04:00
parent 5ae7771050
commit 5ed7582b22
1 changed files with 9 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
grammar/abnf-grammar.txt
View File

@ -823,9 +823,7 @@ circuit-construction = circuit-type "{"
circuit-inline-element = identifier ":" expression / identifier
circuit-access = primary-expression "." identifier
circuit-expression = circuit-construction / circuit-access
circuit-expression = circuit-construction
; There are three kinds of function calls:
; top-level function calls,
@ -847,11 +845,16 @@ function-call = top-level-function-call
function-arguments = "(" [ expression *( "," expression ) ] ")"
; Unary operators have the highest precedence.
; They apply to primary expressions
; Access expressions have highest precedence.
; They apply to primary expressions.
access-expression = primary-expression
/ access-expression "." identifier
; Unary operators have the highest operator precedence.
; They apply to access expressions
; and recursively to unary expressions.
unary-expression = primary-expression
unary-expression = access-expression
/ "!" unary-expression
/ "-" unary-expression