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
|
package parser
import (
"log"
"strconv"
"github.com/mvertes/parscan/lang"
"github.com/mvertes/parscan/scanner"
"github.com/mvertes/parscan/symbol"
"github.com/mvertes/parscan/vm"
)
// parseExpr transform an infix expression into a postfix notation.
func (p *Parser) parseExpr(in Tokens, typeStr string) (out Tokens, err error) {
log.Println("parseExpr2 in:", in)
var ops Tokens
popop := func() (t scanner.Token) {
l := len(ops) - 1
t = ops[l]
ops = ops[:l]
if t.Tok.IsLogicalOp() {
t.Tok = lang.Label // Implement conditional branching directly.
}
return t
}
lin := len(in)
for i := 0; i < lin; i++ {
switch t := in[i]; t.Tok {
case lang.Int, lang.String:
out = append(out, t)
case lang.Func:
// Function as value (i.e closure).
if out, err = p.parseFunc(in); err != nil {
return out, err
}
// Get function label and use it as a symbol ident.
fid := out[1]
fid.Tok = lang.Ident
out = append(out, fid)
return out, err
case lang.Period:
// TODO: fail if next is not an ident.
t.Str += in[i+1].Str // Hardwire selector argument.
for len(ops) > 0 && p.precedence(t) < p.precedence(ops[len(ops)-1]) {
out = append(out, popop())
}
ops = append(ops, t)
i++ // Skip over next ident.
case lang.Colon:
t.Str = typeStr
for len(ops) > 0 && p.precedence(t) < p.precedence(ops[len(ops)-1]) {
out = append(out, popop())
}
ops = append(ops, t)
case lang.Add, lang.And, lang.Assign, lang.Define, lang.Equal, lang.Greater, lang.Less, lang.Mul, lang.Not, lang.Sub, lang.Shl, lang.Shr:
if i == 0 || in[i-1].Tok.IsOperator() {
// An operator preceded by an operator or no token is unary.
t.Tok = lang.UnaryOp[t.Tok]
}
for len(ops) > 0 && p.precedence(t) < p.precedence(ops[len(ops)-1]) {
out = append(out, popop())
}
ops = append(ops, t)
case lang.Land:
for len(ops) > 0 && p.precedence(t) < p.precedence(ops[len(ops)-1]) {
out = append(out, popop())
}
xp := strconv.Itoa(p.labelCount[p.scope])
p.labelCount[p.scope]++
out = append(out, scanner.Token{Tok: lang.JumpSetFalse, Str: p.scope + "x" + xp})
t.Str = p.scope + "x" + xp
ops = append(ops, t)
case lang.Lor:
for len(ops) > 0 && p.precedence(t) < p.precedence(ops[len(ops)-1]) {
out = append(out, popop())
}
xp := strconv.Itoa(p.labelCount[p.scope])
p.labelCount[p.scope]++
out = append(out, scanner.Token{Tok: lang.JumpSetTrue, Str: p.scope + "x" + xp})
t.Str = p.scope + "x" + xp
ops = append(ops, t)
case lang.Ident:
if i < lin-1 && in[i].Tok == lang.Colon {
continue
}
s, sc, ok := p.Symbols.Get(t.Str, p.scope)
if ok && sc != "" {
t.Str = sc + "/" + t.Str
}
if s != nil && s.Kind == symbol.Type {
typeStr = s.Type.String()
}
out = append(out, t)
if i+1 < len(in) && in[i+1].Tok == lang.Define {
// Ident is to be assigned next. Define it as a var.
p.Symbols.Add(symbol.UnsetAddr, t.Str, vm.Value{}, symbol.Var, nil, false)
}
case lang.ParenBlock:
toks, err := p.parseExprStr(t.Block(), typeStr)
if err != nil {
return out, err
}
if i == 0 || in[i-1].Tok.IsOperator() {
out = append(out, toks...)
} else {
prec := p.precedence(scanner.Token{Tok: lang.Call})
for len(ops) > 0 && prec < p.precedence(ops[len(ops)-1]) {
out = append(out, popop())
}
// func call: ensure that the func token in on the top of the stack, after args.
ops = append(ops, scanner.Token{Tok: lang.Call, Pos: t.Pos, Beg: p.numItems(t.Block(), lang.Comma)})
out = append(out, toks...)
}
case lang.BraceBlock:
toks, err := p.parseExprStr(t.Block(), typeStr)
out = append(out, toks...)
if err != nil {
return out, err
}
ops = append(ops, scanner.Token{Tok: lang.Composite, Pos: t.Pos, Str: typeStr})
case lang.BracketBlock:
toks, err := p.parseExprStr(t.Block(), typeStr)
if err != nil {
return out, err
}
out = append(out, toks...)
ops = append(ops, scanner.Token{Tok: lang.Index, Pos: t.Pos})
case lang.Comment:
// return out, nil
case lang.Struct:
typ, err := p.parseTypeExpr(in[i : i+2])
if err != nil {
return out, err
}
typeStr = typ.String()
p.Symbols.Add(symbol.UnsetAddr, typ.String(), vm.NewValue(typ), symbol.Type, typ, p.funcScope != "")
out = append(out, scanner.Token{Tok: lang.Ident, Pos: t.Pos, Str: typeStr})
log.Println("### typ:", typ)
i++
default:
log.Println("unxexpected token:", t)
}
}
for len(ops) > 0 {
out = append(out, popop())
}
log.Println("Final out:", out)
return out, err
}
func (p *Parser) parseExprStr(s, typ string) (tokens Tokens, err error) {
if tokens, err = p.Scan(s, false); err != nil {
return tokens, err
}
var result Tokens
for _, sub := range tokens.Split(lang.Comma) {
toks, err := p.parseExpr(sub, typ)
if err != nil {
return result, err
}
result = append(toks, result...)
}
return result, err
}
|
