mirror of
https://github.com/microsoft/regorus.git
synced 2026-08-05 02:16:11 +00:00
444b2970a1
Indexes allow associating extra data with nodes in the AST using an array and then quickly looking up the array to fetch the extra data. - Index eidx for expressions - Index sidx for statements - Index qidx for queries. AST nodes are not cloneable. Therefore once a module is created, it is not possible to accidentally create two nodes with the same index inadvertently via clone. Also added IndexChecker in debug builds. When a module is parsed, it will assert that indexes have been constructed correctly. AST Cleanup - Make literal expressions (null, val, number, string etc) also structs to match all other expressions - Merge True and False nodes into a single Bool node. Also update dependencies. Signed-off-by: Anand Krishnamoorthi <anakrish@microsoft.com>
54 lines
1.4 KiB
YAML
54 lines
1.4 KiB
YAML
# Copyright (c) Microsoft Corporation.
|
|
# Licensed under the MIT License.
|
|
|
|
cases:
|
|
- note: basic
|
|
rego: |
|
|
package test
|
|
|
|
x = 1 - 2 * 3 / 4 + 2
|
|
num_expressions: 11
|
|
num_queries: 0
|
|
num_statements: 0
|
|
policy:
|
|
- spec:
|
|
head:
|
|
compr:
|
|
refr:
|
|
var: x
|
|
eidx: 1
|
|
assign:
|
|
op: =
|
|
value:
|
|
arithexpr:
|
|
op: +
|
|
lhs:
|
|
arithexpr:
|
|
op: "-"
|
|
lhs:
|
|
number: 1
|
|
eidx: 2
|
|
rhs:
|
|
arithexpr:
|
|
op: "/"
|
|
lhs:
|
|
arithexpr:
|
|
op: "*"
|
|
lhs:
|
|
number: 2
|
|
eidx: 3
|
|
rhs:
|
|
number: 3
|
|
eidx: 4
|
|
eidx: 5
|
|
rhs:
|
|
number: 4
|
|
eidx: 6
|
|
eidx: 7
|
|
eidx: 8
|
|
rhs:
|
|
number: 2
|
|
eidx: 9
|
|
eidx: 10
|
|
bodies: []
|