This repository has been archived by the owner on Feb 21, 2025. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathgrammar.ungram
350 lines (267 loc) · 8.87 KB
/
grammar.ungram
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
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
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
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
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
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
// Our BNF syntax used in the specification below works as follows:
//
// foo ::= bar baz
// Foo derives bar followed by baz.
//
// foo ::= bar | baz
// Foo derives either bar or baz.
//
// bar ::= baz*
// Bar derives a sequence of zero or more baz.
//
// bar ::= baz+
// Bar derives a sequence of one or more baz.
//
// bar ::= foo? baz?
// Bar derives optional foo followed by optional baz.
//
// bar ::= baz%","+
// Bar derives a sequence of one or more baz where consecutive baz"s are separated by a comma
// without a trailing comma.
//
// baz ::= ()
// Baz has a nulling rule (derives an epsilon string).
//
// foo ::= &(bar baz)
// Foo makes a zero-width assertion that bar and baz are present ahead.
//
// foo ::= !(bar baz)
// Foo makes a zero-width assertion that bar and baz are NOT present ahead.
//
// #start foo
// Declare start symbol.
//
// /\w+/ -> ident
// Declare regexp token calle.
SourceFile = Program
Program =
Module
Module =
TopLevelStatement*
TopLevelStatement =
FunctionDefinitionForbidSelf
| StructDefinition
| Implementation
| Submodule
| ModuleDeclaration
| UseStatement
| GlobalDeclaration
GlobalDeclaration =
'global' Ident GlobalTypeAnnotation '=' Literal ';'
Submodule =
'mod' Ident '{' Module '}'
Contract =
'contract' Ident '{' Module '}'
FunctionDefinitionAllowSelf =
Attribute? FunctionModifiers 'fn' Ident Generics '(' FunctionParametersAllowSelf ')' FunctionReturnType Block
FunctionDefinitionForbidSelf =
Attribute? FunctionModifiers 'fn' Ident Generics '(' FunctionParametersForbidSelf ')' FunctionReturnType Block
FunctionModifiers =
'unconstrained'? 'open'?
Generics =
('<' (Ident ',')* Ident '>')?
StructDefinition =
'struct' Ident Generics '{' StructFields '}'
LambdaReturnType =
('->' Type)?
FunctionReturnType =
('->' OptionalVisibility Type)?
Attribute =
'#[' ('foreign(' AsciiAlpha AsciiAlpha* ')' | 'builtin(' AsciiAlpha AsciiAlpha* ')' | 'oracle(' AsciiAlpha AsciiAlpha* ')' | 'test') ']'
StructFields =
((Ident ':' Type) ',')* ((Ident ':' Type) ','?)?
LambdaParameters =
((Pattern ',')* Pattern)?
FunctionParametersForbidSelf =
((Pattern ':' OptionalVisibility Type) ',')* ((Pattern ':' OptionalVisibility Type) ','?)?
FunctionParametersAllowSelf =
((SelfParameter | Pattern ':' OptionalVisibility Type) ',')* ((SelfParameter | Pattern ':' OptionalVisibility Type) ','?)?
SelfParameter =
'self'
Implementation =
'impl' Generics Type '{' FunctionDefinitionAllowSelf* '}'
Block =
'{' StatementNotLast* Expression? '}'
GlobalTypeAnnotation =
(':' Type)?
OptionalTypeAnnotation =
(':' Type)?
ModuleDeclaration =
ModKeyword Ident ';'
ModKeyword =
'mod' Whitespace
UseStatement =
'use' Whitespace Path (Whitespace 'as' Ident)? ';'
Path =
'crate' '::' Idents | 'dep' '::' Idents | Idents
Idents =
(Ident '::')* Ident
Ident =
(AsciiAlpha | '_') (AsciiAlphanumeric | '_')*
StatementNotLast =
Declaration ';' | Assignment ';' | Expression ';' | ExpressionNotSemi
// "constrain" is deprecated
// constrain ::= "constrain" expression
Declaration =
LetKeyword Pattern OptionalTypeAnnotation '=' Expression
LetKeyword =
'let' Whitespace
Pattern =
'mut' Pattern
| '(' ((Pattern ',')* Pattern)? ')'
| Path '{' (((Ident | Ident ':' Pattern) ',')* (Ident | Ident ':' Pattern))? '}'
| Ident
Assignment =
Lvalue AssignOperator Expression
AssignOperator =
('+' | '-' | '*' | '/' | '%' | '&' | '^' | '<<' | '>>' | '|' | '') '='
Lvalue =
Ident ('.' (Ident | LvalueInteger) | '[' Expression ']')*
LvalueInteger =
(Nonzero AsciiDigit* | '0')
Type =
TypeInner
TypeInner =
IntType | FunctionType | VecType | FieldType | BoolType
| StringType | NamedType | ArrayType
| TupleType
OptionalVisibility =
'pub'?
// DEPRECATED
// maybe_comp_time ::= "comptime"?
FieldType =
'Field'
BoolType =
'bool'
StringType =
'str' ('<' (Variable | Integer) '>')?
IntType =
IntTypeToken
IntTypeToken =
'u' AsciiDigit AsciiDigit?
NamedType =
Path GenericTypeArgs
VecType =
'Vec' GenericTypeArgs
GenericTypeArgs =
('<' ((Type | TypeExpression) ',')* (Type | TypeExpression) ','? '>')?
ArrayType =
'[' Type (';' (Variable | Integer))? ']'
TupleType =
'(' ((Type ',')* Type ','?)? ')'
FunctionType =
'fn' '(' ((Type ',')* Type ','?)? ')' '->' Type
////////////////////////////////////////////////////////////////////////////////
/// type_expression ::= expression_with_precedence(lowest_type_precedence, type_expression, true)
/// expression ::= expression_with_precedence(Lowest, expression, false)
/// expression_with_precedence(Highest, ExprParser, true) ::= type_expression_term
/// expression_with_precedence(Highest, ExprParser, false) ::= term
/// expression_with_precedence(precedence, ExprParser, true) ::= expression_with_precedence(precedence.next_type_precedence(), ExprParser, true)
/// (
/// operator_with_precedence(precedence)
/// expression_with_precedence(precedence.next_type_precedence(), ExprParser, true)
/// )*
/// expression_with_precedence(precedence, ExprParser, false) ::= expression_with_precedence(precedence.next(), ExprParser, false)
/// (
/// operator_with_precedence(precedence)
/// expression_with_precedence(precedence.next(), ExprParser, false)
/// )*
/// EQUIVALENT TO:
Expression =
Term (Operator Term)*
ExpressionNoConstructors =
TermNoConstructors (Operator TermNoConstructors)*
ExpressionNotSemi =
IfExpr | Block
Operator =
'==' | '!=' | '|' | '^' | '&' | '<<' | '>>' | '<=' | '>=' | '<' | '>' | ' ' | '*' | '-' | '/' | '*' | '%'
TypeExpression =
TypeExpressionTerm (TypeOperator TypeExpressionTerm)*
TypeOperator =
'+' | '-' | '/' | '*' | '%'
TypeExpressionTerm =
NegationInTypeExpression | TypeExpressionAtom
////////////////////////////////////////////////////////////////////////////////
Term =
Not | Negation | AtomOrRightUnary
TermNoConstructors =
NotNoConstructors | NegationNoConstructors | AtomOrRightUnaryNoConstructors
AtomOrRightUnary =
Atom (CallRhs | ArrayRhs | CastRhs | MemberRhs)*
AtomOrRightUnaryNoConstructors =
AtomNoConstructors (CallRhs | ArrayRhs | CastRhs | MemberRhs)*
CallRhs =
'(' ExpressionList ')'
ArrayRhs =
'[' Expression ']'
CastRhs =
Whitespace 'as' Whitespace Type
MemberRhs =
'.' FieldName ('(' ExpressionList ')')?
IfExpr =
'if' Whitespace ExpressionNoConstructors Block ('else' (Block | IfExpr))?
Lambda =
'|' LambdaParameters '|' LambdaReturnType Expression
ForExpr =
ForKeyword Ident InKeyword ForRange Block
ForKeyword =
'for' Whitespace
InKeyword =
'in' Whitespace
ForRange =
ExpressionNoConstructors '..' ExpressionNoConstructors | ExpressionNoConstructors
ArrayExpr =
StandardArray | ArraySugar
StandardArray =
'[' (Expression ',')* (Expression ','?)? ']'
ArraySugar =
'[' Expression ';' Expression ']'
ExpressionList =
((Expression ',')* Expression ','?)?
Not =
'!' Term
NotNoConstructors =
'!' TermNoConstructors
Negation =
'-' Term
NegationNoConstructors =
'-' TermNoConstructors
NegationInTypeExpression =
'-' TypeExpressionTerm
Atom =
Tuple | IfExpr | ArrayExpr | Constructor | Lambda | Block | Variable | Literal
AtomNoConstructors =
Tuple | IfExpr | ArrayExpr | Lambda | Block | Variable | Literal
TypeExpressionAtom =
Variable | TypeLiteral | '(' TypeExpression ')'
Tuple =
'(' ExpressionList ')'
FieldName =
Ident | Integer
// lexer allows only even number of digits for hex
Integer =
'0x' '00'* (Hex Hex)* | Nonzero AsciiDigit* | '0'
Nonzero =
'1' | '2' | '3' | '4' | '5' | '6' | '7' | '8' | '9'
Hex =
AsciiDigit | 'a' | 'b' | 'c' | 'd' | 'e' | 'f' | 'A' | 'B' | 'C' | 'D' | 'E' | 'F'
Constructor =
Path '{' (ConstructorField ',')* (ConstructorField ','?)? '}'
ConstructorField =
Ident (':' Expression)?
Variable =
Path
Literal =
Integer | Bool | Str
TypeLiteral =
Integer
LiteralOrCollection =
Literal | Constructor | ArrayExpr
Bool =
'true' | 'false'
Str = 'string'
AsciiDigit = '0' | '1' | '2' | '3' | '4' | '5' | '6' | '7' | '8' | '9'
AsciiAlpha = 'a' | 'b' | 'c' | 'd' | 'e' | 'f' | 'g' | 'h' | 'i' | 'j' | 'k' | 'l' | 'm' | 'n' | 'o' | 'p' | 'q' | 'r' | 's' | 't' | 'u' | 'w' | 'x' | 'y' | 'z' | 'A' | 'B' | 'C' | 'D' | 'E' | 'F' | 'G' | 'H' | 'I' | 'J' | 'K' | 'L' | 'M' | 'N' | 'O' | 'P' | 'Q' | 'R' | 'S' | 'T' | 'U' | 'W' | 'X' | 'Y' | 'Z'
AsciiAlphanumeric = AsciiDigit | AsciiAlpha
Whitespace =
' '