Debian Codegraph @

ometa/parsley_tree_transformer.parsley

raw
1 termPattern = indentation? name:name ?(name[0].isupper())
2 '(' expr?:patts ')' -> t.TermPattern(name, patts)
3
4 subtransform = ws '@' name:n -> t.Bind(n, t.Apply('transform', self.rulename, []))
5
6 wide_templatedValue = ws '-->' ' '* wideTemplateBits:contents -> t.StringTemplate(contents)
7 tall_templatedValue = hspace? '{{{' (' ' | '\t')* vspace? tallTemplateBits:contents '}}}' -> t.StringTemplate(contents)
8
9 tallTemplateBits = (exprHole | tallTemplateText)*
10 tallTemplateText = <(~('}}}' | '$' | '\r' | '\n') anything | '$' '$')+ vspace*> | vspace
11
12 wideTemplateBits = (exprHole | wideTemplateText)*
13 wideTemplateText = <(~(vspace | end |'$') anything | '$' '$')+>
14
15 exprHole = '$' name:n -> t.QuasiExprHole(n)
16
17 expr1 = foreignApply
18 |termPattern
19 |subtransform
20 |application
21 |ruleValue
22 |wide_templatedValue
23 |tall_templatedValue
24 |semanticPredicate
25 |semanticAction
26 |number:n !(self.isTree()) -> n
27 |character
28 |string
29 |ws '(' expr?:e ws ')' -> e
30 |ws '[' expr?:e ws ']' -> t.TermPattern(".tuple.", e or t.And([]))
31
32 grammar = rule*:rs ws -> t.Grammar(self.name, True, rs)
33 rule = noindentation ~~(name:n) (termRulePart(n)+:rs | rulePart(n)+:rs) -> t.Rule(n, t.Or(rs))
34
35 termRulePart :requiredName = noindentation !(setattr(self, "rulename", requiredName))
36 termPattern:tt ?(tt.args[0].data == requiredName) token("=")? expr:tail -> t.And([tt, tail])