better code generation for constant aggregates
This commit is contained in:
parent
47f523cfb8
commit
351e89e705
10 changed files with 79 additions and 32 deletions
|
|
@ -474,7 +474,8 @@ proc lowestExprAux(p: var TParser, limit: int): PNode =
|
|||
var a = newNodeP(nkInfix, p)
|
||||
var opNode = newIdentNodeP(p.tok.ident, p) # skip operator:
|
||||
getTok(p)
|
||||
optInd(p, opNode) # read sub-expression with higher priority
|
||||
optInd(p, opNode)
|
||||
# read sub-expression with higher priority:
|
||||
var b = lowestExprAux(p, opPrec + leftAssoc)
|
||||
addSon(a, opNode)
|
||||
addSon(a, result)
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue