/
forexpressionparser.go
52 lines (42 loc) · 1.37 KB
/
forexpressionparser.go
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
package parser
import (
"github.com/a-h/parse"
"github.com/a-h/templ/parser/v2/goexpression"
)
var forExpression parse.Parser[Node] = forExpressionParser{}
type forExpressionParser struct{}
func (_ forExpressionParser) Parse(pi *parse.Input) (n Node, ok bool, err error) {
var r ForExpression
start := pi.Index()
// Strip leading whitespace and look for `for `.
if _, _, err = parse.OptionalWhitespace.Parse(pi); err != nil {
return r, false, err
}
if !peekPrefix(pi, "for ") {
pi.Seek(start)
return r, false, nil
}
// Parse the Go for expression.
if r.Expression, err = parseGo("for", pi, goexpression.For); err != nil {
return r, false, err
}
// Eat " {\n".
if _, ok, err = parse.All(openBraceWithOptionalPadding, parse.NewLine).Parse(pi); err != nil || !ok {
err = parse.Error("for: "+unterminatedMissingCurly, pi.PositionAt(start))
return
}
// Node contents.
tnp := newTemplateNodeParser(closeBraceWithOptionalPadding, "for expression closing brace")
var nodes Nodes
if nodes, ok, err = tnp.Parse(pi); err != nil || !ok {
err = parse.Error("for: expected nodes, but none were found", pi.Position())
return
}
r.Children = nodes.Nodes
// Read the required closing brace.
if _, ok, err = closeBraceWithOptionalPadding.Parse(pi); err != nil || !ok {
err = parse.Error("for: "+unterminatedMissingEnd, pi.Position())
return
}
return r, true, nil
}