Module: ActiveFacts::CQL::TransformRules
- Includes:
- Treetop::Runtime
- Included in:
- CQL, TransformRulesParser
- Defined in:
- lib/activefacts/cql/parser/TransformRules.rb
Defined Under Namespace
Modules: AdditiveTexpr0, AdditiveTexpr1, AdditiveTexpr2, CompoundMatching0, CompoundMatching1, EqualityTexpr0, EqualityTexpr1, EqualityTexpr2, LogicalAndTexpr0, LogicalAndTexpr1, LogicalAndTexpr2, LogicalTexpr0, LogicalTexpr1, LogicalTexpr2, MultiplicativeTexpr0, MultiplicativeTexpr1, MultiplicativeTexpr2, PrimaryTexpr0, PrimaryTexpr1, PrimaryTexpr2, PrimaryTexpr3, RelationalTexpr0, RelationalTexpr1, RelationalTexpr2, SimpleMatching0, SimpleMatching1, TermList0, TermList1, TermList2, TransformExpr0, TransformExpr1, TransformExpr2, TransformExpr3, TransformExpr4, TransformExpr5, TransformMatching0, TransformMatching1, TransformMatching2, TransformMatching3, TransformMatchings0, TransformMatchings1, TransformMatchings2, TransformQuery0, TransformQuery1, TransformQuery2, TransformQuery3, TransformRule0, TransformRule1, UnaryTexpr0, UnaryTexpr1
Instance Method Summary
collapse
Instance Method Details
#_nt_additive_op ⇒ Object
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 1610
def _nt_additive_op
start_index = index
if node_cache[:additive_op].has_key?(index)
cached = node_cache[:additive_op][index]
if cached
node_cache[:additive_op][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0 = index
if (match_len = has_terminal?('+', false, index))
r1 = true
@index += match_len
else
terminal_parse_failure('\'+\'')
r1 = nil
end
if r1
r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
r0 = r1
else
if (match_len = has_terminal?('-', false, index))
r2 = true
@index += match_len
else
terminal_parse_failure('\'-\'')
r2 = nil
end
if r2
r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
r0 = r2
else
@index = i0
r0 = nil
end
end
node_cache[:additive_op][start_index] = r0
r0
end
|
#_nt_additive_texpr ⇒ Object
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 1544
def _nt_additive_texpr
start_index = index
if node_cache[:additive_texpr].has_key?(index)
cached = node_cache[:additive_texpr][index]
if cached
node_cache[:additive_texpr][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0, s0 = index, []
r1 = _nt_s
s0 << r1
if r1
r2 = _nt_multiplicative_texpr
s0 << r2
if r2
s3, i3 = [], index
loop do
i4, s4 = index, []
r5 = _nt_s
s4 << r5
if r5
r6 = _nt_additive_op
s4 << r6
if r6
r7 = _nt_s
s4 << r7
if r7
r8 = _nt_multiplicative_texpr
s4 << r8
end
end
end
if s4.last
r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
r4.extend(AdditiveTexpr0)
else
@index = i4
r4 = nil
end
if r4
s3 << r4
else
break
end
end
r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
s0 << r3
end
end
if s0.last
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
r0.extend(AdditiveTexpr1)
r0.extend(AdditiveTexpr2)
else
@index = i0
r0 = nil
end
node_cache[:additive_texpr][start_index] = r0
r0
end
|
#_nt_aggregate_op ⇒ Object
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 883
def _nt_aggregate_op
start_index = index
if node_cache[:aggregate_op].has_key?(index)
cached = node_cache[:aggregate_op][index]
if cached
node_cache[:aggregate_op][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0 = index
if (match_len = has_terminal?('sum', false, index))
r1 = instantiate_node(SyntaxNode,input, index...(index + match_len))
@index += match_len
else
terminal_parse_failure('\'sum\'')
r1 = nil
end
if r1
r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
r0 = r1
else
if (match_len = has_terminal?('average', false, index))
r2 = instantiate_node(SyntaxNode,input, index...(index + match_len))
@index += match_len
else
terminal_parse_failure('\'average\'')
r2 = nil
end
if r2
r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
r0 = r2
else
if (match_len = has_terminal?('max', false, index))
r3 = instantiate_node(SyntaxNode,input, index...(index + match_len))
@index += match_len
else
terminal_parse_failure('\'max\'')
r3 = nil
end
if r3
r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true
r0 = r3
else
if (match_len = has_terminal?('min', false, index))
r4 = instantiate_node(SyntaxNode,input, index...(index + match_len))
@index += match_len
else
terminal_parse_failure('\'min\'')
r4 = nil
end
if r4
r4 = SyntaxNode.new(input, (index-1)...index) if r4 == true
r0 = r4
else
if (match_len = has_terminal?('count', false, index))
r5 = instantiate_node(SyntaxNode,input, index...(index + match_len))
@index += match_len
else
terminal_parse_failure('\'count\'')
r5 = nil
end
if r5
r5 = SyntaxNode.new(input, (index-1)...index) if r5 == true
r0 = r5
else
@index = i0
r0 = nil
end
end
end
end
end
node_cache[:aggregate_op][start_index] = r0
r0
end
|
#_nt_compound_matching ⇒ Object
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 119
def _nt_compound_matching
start_index = index
if node_cache[:compound_matching].has_key?(index)
cached = node_cache[:compound_matching][index]
if cached
node_cache[:compound_matching][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0, s0 = index, []
r1 = _nt_s
s0 << r1
if r1
r2 = _nt_term_list
s0 << r2
if r2
r3 = _nt_s
s0 << r3
if r3
if (match_len = has_terminal?('<==', false, index))
r4 = instantiate_node(SyntaxNode,input, index...(index + match_len))
@index += match_len
else
terminal_parse_failure('\'<==\'')
r4 = nil
end
s0 << r4
if r4
r5 = _nt_s
s0 << r5
if r5
r7 = _nt_transform_query
if r7
r6 = r7
else
r6 = instantiate_node(SyntaxNode,input, index...index)
end
s0 << r6
if r6
r8 = _nt_s
s0 << r8
if r8
if (match_len = has_terminal?('{', false, index))
r9 = true
@index += match_len
else
terminal_parse_failure('\'{\'')
r9 = nil
end
s0 << r9
if r9
r10 = _nt_transform_matchings
s0 << r10
if r10
r11 = _nt_s
s0 << r11
if r11
if (match_len = has_terminal?('}', false, index))
r12 = true
@index += match_len
else
terminal_parse_failure('\'}\'')
r12 = nil
end
s0 << r12
end
end
end
end
end
end
end
end
end
end
if s0.last
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
r0.extend(CompoundMatching0)
r0.extend(CompoundMatching1)
else
@index = i0
r0 = nil
end
node_cache[:compound_matching][start_index] = r0
r0
end
|
#_nt_equality_op ⇒ Object
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 1283
def _nt_equality_op
start_index = index
if node_cache[:equality_op].has_key?(index)
cached = node_cache[:equality_op][index]
if cached
node_cache[:equality_op][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0 = index
if (match_len = has_terminal?('=', false, index))
r1 = true
@index += match_len
else
terminal_parse_failure('\'=\'')
r1 = nil
end
if r1
r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
r0 = r1
else
if (match_len = has_terminal?('!=', false, index))
r2 = instantiate_node(SyntaxNode,input, index...(index + match_len))
@index += match_len
else
terminal_parse_failure('\'!=\'')
r2 = nil
end
if r2
r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
r0 = r2
else
@index = i0
r0 = nil
end
end
node_cache[:equality_op][start_index] = r0
r0
end
|
#_nt_equality_texpr ⇒ Object
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 1221
def _nt_equality_texpr
start_index = index
if node_cache[:equality_texpr].has_key?(index)
cached = node_cache[:equality_texpr][index]
if cached
node_cache[:equality_texpr][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0, s0 = index, []
r1 = _nt_s
s0 << r1
if r1
r2 = _nt_relational_texpr
s0 << r2
if r2
i4, s4 = index, []
r5 = _nt_s
s4 << r5
if r5
r6 = _nt_equality_op
s4 << r6
if r6
r7 = _nt_s
s4 << r7
if r7
r8 = _nt_relational_texpr
s4 << r8
end
end
end
if s4.last
r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
r4.extend(EqualityTexpr0)
else
@index = i4
r4 = nil
end
if r4
r3 = r4
else
r3 = instantiate_node(SyntaxNode,input, index...index)
end
s0 << r3
end
end
if s0.last
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
r0.extend(EqualityTexpr1)
r0.extend(EqualityTexpr2)
else
@index = i0
r0 = nil
end
node_cache[:equality_texpr][start_index] = r0
r0
end
|
#_nt_logical_and_texpr ⇒ Object
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 1113
def _nt_logical_and_texpr
start_index = index
if node_cache[:logical_and_texpr].has_key?(index)
cached = node_cache[:logical_and_texpr][index]
if cached
node_cache[:logical_and_texpr][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0, s0 = index, []
r1 = _nt_s
s0 << r1
if r1
r2 = _nt_equality_texpr
s0 << r2
if r2
s3, i3 = [], index
loop do
i4, s4 = index, []
r5 = _nt_s
s4 << r5
if r5
r6 = _nt_and
s4 << r6
if r6
r7 = _nt_s
s4 << r7
if r7
r8 = _nt_equality_texpr
s4 << r8
end
end
end
if s4.last
r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
r4.extend(LogicalAndTexpr0)
else
@index = i4
r4 = nil
end
if r4
s3 << r4
else
break
end
end
r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
s0 << r3
end
end
if s0.last
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
r0.extend(LogicalAndTexpr1)
r0.extend(LogicalAndTexpr2)
else
@index = i0
r0 = nil
end
node_cache[:logical_and_texpr][start_index] = r0
r0
end
|
#_nt_logical_texpr ⇒ Object
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 1005
def _nt_logical_texpr
start_index = index
if node_cache[:logical_texpr].has_key?(index)
cached = node_cache[:logical_texpr][index]
if cached
node_cache[:logical_texpr][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0, s0 = index, []
r1 = _nt_s
s0 << r1
if r1
r2 = _nt_logical_and_texpr
s0 << r2
if r2
s3, i3 = [], index
loop do
i4, s4 = index, []
r5 = _nt_s
s4 << r5
if r5
r6 = _nt_or
s4 << r6
if r6
r7 = _nt_s
s4 << r7
if r7
r8 = _nt_logical_and_texpr
s4 << r8
end
end
end
if s4.last
r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
r4.extend(LogicalTexpr0)
else
@index = i4
r4 = nil
end
if r4
s3 << r4
else
break
end
end
r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
s0 << r3
end
end
if s0.last
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
r0.extend(LogicalTexpr1)
r0.extend(LogicalTexpr2)
else
@index = i0
r0 = nil
end
node_cache[:logical_texpr][start_index] = r0
r0
end
|
#_nt_multiplicative_op ⇒ Object
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 1765
def _nt_multiplicative_op
start_index = index
if node_cache[:multiplicative_op].has_key?(index)
cached = node_cache[:multiplicative_op][index]
if cached
node_cache[:multiplicative_op][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0 = index
if (match_len = has_terminal?('*', false, index))
r1 = true
@index += match_len
else
terminal_parse_failure('\'*\'')
r1 = nil
end
if r1
r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
r0 = r1
else
if (match_len = has_terminal?('/', false, index))
r2 = true
@index += match_len
else
terminal_parse_failure('\'/\'')
r2 = nil
end
if r2
r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
r0 = r2
else
@index = i0
r0 = nil
end
end
node_cache[:multiplicative_op][start_index] = r0
r0
end
|
#_nt_multiplicative_texpr ⇒ Object
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 1699
def _nt_multiplicative_texpr
start_index = index
if node_cache[:multiplicative_texpr].has_key?(index)
cached = node_cache[:multiplicative_texpr][index]
if cached
node_cache[:multiplicative_texpr][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0, s0 = index, []
r1 = _nt_s
s0 << r1
if r1
r2 = _nt_unary_texpr
s0 << r2
if r2
s3, i3 = [], index
loop do
i4, s4 = index, []
r5 = _nt_s
s4 << r5
if r5
r6 = _nt_multiplicative_op
s4 << r6
if r6
r7 = _nt_s
s4 << r7
if r7
r8 = _nt_unary_texpr
s4 << r8
end
end
end
if s4.last
r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
r4.extend(MultiplicativeTexpr0)
else
@index = i4
r4 = nil
end
if r4
s3 << r4
else
break
end
end
r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
s0 << r3
end
end
if s0.last
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
r0.extend(MultiplicativeTexpr1)
r0.extend(MultiplicativeTexpr2)
else
@index = i0
r0 = nil
end
node_cache[:multiplicative_texpr][start_index] = r0
r0
end
|
#_nt_primary_texpr ⇒ Object
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 1950
def _nt_primary_texpr
start_index = index
if node_cache[:primary_texpr].has_key?(index)
cached = node_cache[:primary_texpr][index]
if cached
node_cache[:primary_texpr][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0 = index
i1, s1 = index, []
r2 = _nt_term_list
s1 << r2
if s1.last
r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
r1.extend(PrimaryTexpr0)
r1.extend(PrimaryTexpr1)
else
@index = i1
r1 = nil
end
if r1
r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
r0 = r1
else
i3, s3 = index, []
r4 = _nt_literal
s3 << r4
if s3.last
r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
r3.extend(PrimaryTexpr2)
r3.extend(PrimaryTexpr3)
else
@index = i3
r3 = nil
end
if r3
r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true
r0 = r3
else
@index = i0
r0 = nil
end
end
node_cache[:primary_texpr][start_index] = r0
r0
end
|
#_nt_relational_op ⇒ Object
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 1431
def _nt_relational_op
start_index = index
if node_cache[:relational_op].has_key?(index)
cached = node_cache[:relational_op][index]
if cached
node_cache[:relational_op][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0 = index
if (match_len = has_terminal?('<', false, index))
r1 = true
@index += match_len
else
terminal_parse_failure('\'<\'')
r1 = nil
end
if r1
r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
r0 = r1
else
if (match_len = has_terminal?('>', false, index))
r2 = true
@index += match_len
else
terminal_parse_failure('\'>\'')
r2 = nil
end
if r2
r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
r0 = r2
else
if (match_len = has_terminal?('>=', false, index))
r3 = instantiate_node(SyntaxNode,input, index...(index + match_len))
@index += match_len
else
terminal_parse_failure('\'>=\'')
r3 = nil
end
if r3
r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true
r0 = r3
else
if (match_len = has_terminal?('<=', false, index))
r4 = instantiate_node(SyntaxNode,input, index...(index + match_len))
@index += match_len
else
terminal_parse_failure('\'<=\'')
r4 = nil
end
if r4
r4 = SyntaxNode.new(input, (index-1)...index) if r4 == true
r0 = r4
else
@index = i0
r0 = nil
end
end
end
end
node_cache[:relational_op][start_index] = r0
r0
end
|
#_nt_relational_texpr ⇒ Object
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 1369
def _nt_relational_texpr
start_index = index
if node_cache[:relational_texpr].has_key?(index)
cached = node_cache[:relational_texpr][index]
if cached
node_cache[:relational_texpr][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0, s0 = index, []
r1 = _nt_s
s0 << r1
if r1
r2 = _nt_additive_texpr
s0 << r2
if r2
i4, s4 = index, []
r5 = _nt_s
s4 << r5
if r5
r6 = _nt_relational_op
s4 << r6
if r6
r7 = _nt_s
s4 << r7
if r7
r8 = _nt_additive_texpr
s4 << r8
end
end
end
if s4.last
r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
r4.extend(RelationalTexpr0)
else
@index = i4
r4 = nil
end
if r4
r3 = r4
else
r3 = instantiate_node(SyntaxNode,input, index...index)
end
s0 << r3
end
end
if s0.last
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
r0.extend(RelationalTexpr1)
r0.extend(RelationalTexpr2)
else
@index = i0
r0 = nil
end
node_cache[:relational_texpr][start_index] = r0
r0
end
|
#_nt_simple_matching ⇒ Object
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 238
def _nt_simple_matching
start_index = index
if node_cache[:simple_matching].has_key?(index)
cached = node_cache[:simple_matching][index]
if cached
node_cache[:simple_matching][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0, s0 = index, []
r1 = _nt_s
s0 << r1
if r1
r2 = _nt_term_list
s0 << r2
if r2
r3 = _nt_s
s0 << r3
if r3
if (match_len = has_terminal?('<--', false, index))
r4 = instantiate_node(SyntaxNode,input, index...(index + match_len))
@index += match_len
else
terminal_parse_failure('\'<--\'')
r4 = nil
end
s0 << r4
if r4
r5 = _nt_s
s0 << r5
if r5
r7 = _nt_transform_expr
if r7
r6 = r7
else
r6 = instantiate_node(SyntaxNode,input, index...index)
end
s0 << r6
end
end
end
end
end
if s0.last
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
r0.extend(SimpleMatching0)
r0.extend(SimpleMatching1)
else
@index = i0
r0 = nil
end
node_cache[:simple_matching][start_index] = r0
r0
end
|
#_nt_term_list ⇒ Object
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 585
def _nt_term_list
start_index = index
if node_cache[:term_list].has_key?(index)
cached = node_cache[:term_list][index]
if cached
node_cache[:term_list][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0, s0 = index, []
r1 = _nt_s
s0 << r1
if r1
r2 = _nt_term
s0 << r2
if r2
s3, i3 = [], index
loop do
i4, s4 = index, []
r5 = _nt_s
s4 << r5
if r5
if (match_len = has_terminal?('.', false, index))
r6 = true
@index += match_len
else
terminal_parse_failure('\'.\'')
r6 = nil
end
s4 << r6
if r6
r7 = _nt_s
s4 << r7
if r7
r8 = _nt_term_list
s4 << r8
end
end
end
if s4.last
r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
r4.extend(TermList0)
else
@index = i4
r4 = nil
end
if r4
s3 << r4
else
break
end
end
r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
s0 << r3
end
end
if s0.last
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
r0.extend(TermList1)
r0.extend(TermList2)
else
@index = i0
r0 = nil
end
node_cache[:term_list][start_index] = r0
r0
end
|
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 743
def _nt_transform_expr
start_index = index
if node_cache[:transform_expr].has_key?(index)
cached = node_cache[:transform_expr][index]
if cached
node_cache[:transform_expr][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0 = index
i1, s1 = index, []
r2 = _nt_s
s1 << r2
if r2
r3 = _nt_logical_texpr
s1 << r3
if r3
r4 = _nt_s
s1 << r4
if r4
if (match_len = has_terminal?('?', false, index))
r5 = true
@index += match_len
else
terminal_parse_failure('\'?\'')
r5 = nil
end
s1 << r5
if r5
r6 = _nt_s
s1 << r6
if r6
r7 = _nt_logical_texpr
s1 << r7
if r7
r8 = _nt_s
s1 << r8
if r8
if (match_len = has_terminal?(':', false, index))
r9 = true
@index += match_len
else
terminal_parse_failure('\':\'')
r9 = nil
end
s1 << r9
if r9
r10 = _nt_s
s1 << r10
if r10
r11 = _nt_logical_texpr
s1 << r11
end
end
end
end
end
end
end
end
end
if s1.last
r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
r1.extend(TransformExpr0)
r1.extend(TransformExpr1)
else
@index = i1
r1 = nil
end
if r1
r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
r0 = r1
else
i12, s12 = index, []
r13 = _nt_s
s12 << r13
if r13
r14 = _nt_aggregate_op
s12 << r14
if r14
r15 = _nt_S
s12 << r15
if r15
r16 = _nt_agg_of
s12 << r16
if r16
r17 = _nt_s
s12 << r17
if r17
r18 = _nt_logical_texpr
s12 << r18
end
end
end
end
end
if s12.last
r12 = instantiate_node(SyntaxNode,input, i12...index, s12)
r12.extend(TransformExpr2)
r12.extend(TransformExpr3)
else
@index = i12
r12 = nil
end
if r12
r12 = SyntaxNode.new(input, (index-1)...index) if r12 == true
r0 = r12
else
i19, s19 = index, []
r20 = _nt_s
s19 << r20
if r20
r21 = _nt_logical_texpr
s19 << r21
end
if s19.last
r19 = instantiate_node(SyntaxNode,input, i19...index, s19)
r19.extend(TransformExpr4)
r19.extend(TransformExpr5)
else
@index = i19
r19 = nil
end
if r19
r19 = SyntaxNode.new(input, (index-1)...index) if r19 == true
r0 = r19
else
@index = i0
r0 = nil
end
end
end
node_cache[:transform_expr][start_index] = r0
r0
end
|
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 495
def _nt_transform_matching
start_index = index
if node_cache[:transform_matching].has_key?(index)
cached = node_cache[:transform_matching][index]
if cached
node_cache[:transform_matching][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0 = index
i1, s1 = index, []
r2 = _nt_simple_matching
s1 << r2
if s1.last
r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
r1.extend(TransformMatching0)
r1.extend(TransformMatching1)
else
@index = i1
r1 = nil
end
if r1
r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
r0 = r1
else
i3, s3 = index, []
r4 = _nt_compound_matching
s3 << r4
if s3.last
r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
r3.extend(TransformMatching2)
r3.extend(TransformMatching3)
else
@index = i3
r3 = nil
end
if r3
r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true
r0 = r3
else
@index = i0
r0 = nil
end
end
node_cache[:transform_matching][start_index] = r0
r0
end
|
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 403
def _nt_transform_matchings
start_index = index
if node_cache[:transform_matchings].has_key?(index)
cached = node_cache[:transform_matchings][index]
if cached
node_cache[:transform_matchings][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0, s0 = index, []
r1 = _nt_s
s0 << r1
if r1
r2 = _nt_transform_matching
s0 << r2
if r2
s3, i3 = [], index
loop do
i4, s4 = index, []
r5 = _nt_s
s4 << r5
if r5
if (match_len = has_terminal?(',', false, index))
r6 = true
@index += match_len
else
terminal_parse_failure('\',\'')
r6 = nil
end
s4 << r6
if r6
r7 = _nt_s
s4 << r7
if r7
r8 = _nt_transform_matching
s4 << r8
end
end
end
if s4.last
r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
r4.extend(TransformMatchings0)
else
@index = i4
r4 = nil
end
if r4
s3 << r4
else
break
end
end
r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
s0 << r3
end
end
if s0.last
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
r0.extend(TransformMatchings1)
r0.extend(TransformMatchings2)
else
@index = i0
r0 = nil
end
node_cache[:transform_matchings][start_index] = r0
r0
end
|
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 317
def _nt_transform_query
start_index = index
if node_cache[:transform_query].has_key?(index)
cached = node_cache[:transform_query][index]
if cached
node_cache[:transform_query][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0 = index
i1, s1 = index, []
r2 = _nt_clauses_list
s1 << r2
if s1.last
r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
r1.extend(TransformQuery0)
r1.extend(TransformQuery1)
else
@index = i1
r1 = nil
end
if r1
r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
r0 = r1
else
i3, s3 = index, []
r4 = _nt_term
s3 << r4
if s3.last
r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
r3.extend(TransformQuery2)
r3.extend(TransformQuery3)
else
@index = i3
r3 = nil
end
if r3
r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true
r0 = r3
else
@index = i0
r0 = nil
end
end
node_cache[:transform_query][start_index] = r0
r0
end
|
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 36
def _nt_transform_rule
start_index = index
if node_cache[:transform_rule].has_key?(index)
cached = node_cache[:transform_rule][index]
if cached
node_cache[:transform_rule][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0, s0 = index, []
r1 = _nt_compound_matching
s0 << r1
if r1
r2 = _nt_s
s0 << r2
if r2
if (match_len = has_terminal?(';', false, index))
r3 = true
@index += match_len
else
terminal_parse_failure('\';\'')
r3 = nil
end
s0 << r3
end
end
if s0.last
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
r0.extend(TransformRule0)
r0.extend(TransformRule1)
else
@index = i0
r0 = nil
end
node_cache[:transform_rule][start_index] = r0
r0
end
|
#_nt_unary_op ⇒ Object
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 1882
def _nt_unary_op
start_index = index
if node_cache[:unary_op].has_key?(index)
cached = node_cache[:unary_op][index]
if cached
node_cache[:unary_op][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0 = index
if (match_len = has_terminal?('-', false, index))
r1 = true
@index += match_len
else
terminal_parse_failure('\'-\'')
r1 = nil
end
if r1
r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
r0 = r1
else
if (match_len = has_terminal?('!', false, index))
r2 = true
@index += match_len
else
terminal_parse_failure('\'!\'')
r2 = nil
end
if r2
r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
r0 = r2
else
@index = i0
r0 = nil
end
end
node_cache[:unary_op][start_index] = r0
r0
end
|
#_nt_unary_texpr ⇒ Object
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 1837
def _nt_unary_texpr
start_index = index
if node_cache[:unary_texpr].has_key?(index)
cached = node_cache[:unary_texpr][index]
if cached
node_cache[:unary_texpr][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
@index = cached.interval.end
end
return cached
end
i0, s0 = index, []
r1 = _nt_s
s0 << r1
if r1
r3 = _nt_unary_op
if r3
r2 = r3
else
r2 = instantiate_node(SyntaxNode,input, index...index)
end
s0 << r2
if r2
r4 = _nt_s
s0 << r4
if r4
r5 = _nt_primary_texpr
s0 << r5
end
end
end
if s0.last
r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
r0.extend(UnaryTexpr0)
r0.extend(UnaryTexpr1)
else
@index = i0
r0 = nil
end
node_cache[:unary_texpr][start_index] = r0
r0
end
|
#root ⇒ Object
15
16
17
|
# File 'lib/activefacts/cql/parser/TransformRules.rb', line 15
def root
@root ||= :transform_rule
end
|