Answer architecture round 1: calls carry no operands in the grammar, ParseCalc returns its operands, one empty-segment check, sorted token kinds, and file items 110 and 111
This commit is contained in:
+1
-1
@@ -210,7 +210,7 @@ func refTokens(toks []grammar.Token) []string {
|
||||
var refs []string
|
||||
seen := map[string]bool{}
|
||||
for _, tok := range toks {
|
||||
names := tok.Names
|
||||
names := tokenReads(tok)
|
||||
if tok.Kind == grammar.NameBind {
|
||||
names = []string{tok.BoundRef}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user