Files
regorus/tests/parser/cases/expressions/bin.yaml
Anand Krishnamoorthi 444b2970a1 feat!: Indexes for nodes in the AST (#414)
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>
2025-06-20 15:09:07 -05:00

90 lines
2.4 KiB
YAML

# Copyright (c) Microsoft Corporation.
# Licensed under the MIT License.
cases:
- note: basic
rego: |
package test
# & has higher precedence than |.
# If not the following expressions would evaluate to empty set.
x = {1, 2, 3} | {2} & {4}
y = {2} & {4} | {1, 2, 3}
num_expressions: 23
num_statements: 0
num_queries: 0
policy:
- spec:
head:
compr:
refr:
var: x
eidx: 1
assign:
op: =
value:
binexpr:
op: "|"
lhs:
set:
- number: 1
eidx: 2
- number: 2
eidx: 3
- number: 3
eidx: 4
eidx: 5
rhs:
binexpr:
op: "&"
lhs:
set:
- number: 2
eidx: 6
eidx: 7
rhs:
set:
- number: 4
eidx: 8
eidx: 9
eidx: 10
eidx: 11
bodies: []
- spec:
head:
compr:
refr:
var: y
eidx: 12
assign:
op: =
value:
binexpr:
op: "|"
rhs:
set:
- number: 1
eidx: 18
- number: 2
eidx: 19
- number: 3
eidx: 20
eidx: 21
lhs:
binexpr:
op: "&"
lhs:
set:
- number: 2
eidx: 13
eidx: 14
rhs:
set:
- number: 4
eidx: 15
eidx: 16
eidx: 17
eidx: 22
bodies: []