@@ -83,7 +83,7 @@ into effect for the Regex:
83
83
say so 'once upon a time' ~~ &space-y; # OUTPUT: «True»
84
84
= end code
85
85
86
- = head1 X < Creating Grammars >
86
+ = head1 X < Creating grammars >
87
87
= SUBTITLE Group of named regexes that form a formal grammar
88
88
89
89
L < Grammar|/type/Grammar > is the superclass that classes automatically get when
@@ -177,7 +177,7 @@ calculator:
177
177
All we had to add are additional rule and action to the C < calc-op > group and
178
178
the thing works—all thanks to proto regexes.
179
179
180
- = head2 Special Tokens
180
+ = head2 Special tokens
181
181
182
182
183
183
= head3 X < C < TOP > |TOP>
@@ -257,7 +257,7 @@ adverb for that particular regex:
257
257
This comes in handy when you're already differentiating the proto regexes with the strings
258
258
you're going to match, as using C « <sym> » token prevents repetition of those strings.
259
259
260
- = head3 X « Always Succeed Assertion | <?> »
260
+ = head3 X « " Always succeed" assertion | <?>»
261
261
262
262
The C « <?> » is the I < always succeed > assertion. When used as a grammar
263
263
token, it can be used to trigger an Action class method. In the following
@@ -409,7 +409,7 @@ attributes can be accessed in the match returned after parsing if made public:
409
409
say $<field>».invalid;
410
410
# OUTPUT: [(Bool) True]
411
411
412
- = head1 X < Action Objects |Actions >
412
+ = head1 X < Action objects |Actions >
413
413
414
414
A successful grammar match gives you a parse tree of L < Match|/type/Match >
415
415
objects, and the deeper that match tree gets, and the more branches in the
0 commit comments