maride/php-parser
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

walker: leave node event

Browse Source
This commit is contained in:
vadim
2017-12-28 13:36:27 +02:00
parent 79d3bb1674
commit 722fa00fa3
154 changed files with 691 additions and 398 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
node/expr/assign_op/assign.go
View File

@@ -23,17 +23,19 @@ func NewAssign(variable node.Node, expression node.Node) node.Node {
}
func (n Assign) Walk(v node.Visitor) {
if v.Visit(n) == false {
if v.EnterNode(n) == false {
return
}
if n.variable != nil {
vv := v.Children("variable")
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
}
if n.expression != nil {
vv := v.Children("expression")
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
}
v.LeaveNode(n)
}

8
node/expr/assign_op/assign_ref.go
View File

@@ -23,17 +23,19 @@ func NewAssignRef(variable node.Node, expression node.Node) node.Node {
}
func (n AssignRef) Walk(v node.Visitor) {
if v.Visit(n) == false {
if v.EnterNode(n) == false {
return
}
if n.variable != nil {
vv := v.Children("variable")
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
}
if n.expression != nil {
vv := v.Children("expression")
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
}
v.LeaveNode(n)
}

8
node/expr/assign_op/bitwise_and.go
View File

@@ -23,17 +23,19 @@ func NewBitwiseAnd(variable node.Node, expression node.Node) node.Node {
}
func (n BitwiseAnd) Walk(v node.Visitor) {
if v.Visit(n) == false {
if v.EnterNode(n) == false {
return
}
if n.variable != nil {
vv := v.Children("variable")
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
}
if n.expression != nil {
vv := v.Children("expression")
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
}
v.LeaveNode(n)
}

8
node/expr/assign_op/bitwise_or.go
View File

@@ -23,17 +23,19 @@ func NewBitwiseOr(variable node.Node, expression node.Node) node.Node {
}
func (n BitwiseOr) Walk(v node.Visitor) {
if v.Visit(n) == false {
if v.EnterNode(n) == false {
return
}
if n.variable != nil {
vv := v.Children("variable")
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
}
if n.expression != nil {
vv := v.Children("expression")
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
}
v.LeaveNode(n)
}

8
node/expr/assign_op/bitwise_xor.go
View File

@@ -23,17 +23,19 @@ func (n BitwiseXor) Name() string {
}
func (n BitwiseXor) Walk(v node.Visitor) {
if v.Visit(n) == false {
if v.EnterNode(n) == false {
return
}
if n.variable != nil {
vv := v.Children("variable")
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
}
if n.expression != nil {
vv := v.Children("expression")
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
}
v.LeaveNode(n)
}

8
node/expr/assign_op/concat.go
View File

@@ -23,17 +23,19 @@ func NewConcat(variable node.Node, expression node.Node) node.Node {
}
func (n Concat) Walk(v node.Visitor) {
if v.Visit(n) == false {
if v.EnterNode(n) == false {
return
}
if n.variable != nil {
vv := v.Children("variable")
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
}
if n.expression != nil {
vv := v.Children("expression")
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
}
v.LeaveNode(n)
}

8
node/expr/assign_op/div.go
View File

@@ -23,17 +23,19 @@ func NewDiv(variable node.Node, expression node.Node) node.Node {
}
func (n Div) Walk(v node.Visitor) {
if v.Visit(n) == false {
if v.EnterNode(n) == false {
return
}
if n.variable != nil {
vv := v.Children("variable")
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
}
if n.expression != nil {
vv := v.Children("expression")
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
}
v.LeaveNode(n)
}

8
node/expr/assign_op/minus.go
View File

@@ -23,17 +23,19 @@ func NewMinus(variable node.Node, expression node.Node) node.Node {
}
func (n Minus) Walk(v node.Visitor) {
if v.Visit(n) == false {
if v.EnterNode(n) == false {
return
}
if n.variable != nil {
vv := v.Children("variable")
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
}
if n.expression != nil {
vv := v.Children("expression")
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
}
v.LeaveNode(n)
}

8
node/expr/assign_op/mod.go
View File

@@ -23,17 +23,19 @@ func NewMod(variable node.Node, expression node.Node) node.Node {
}
func (n Mod) Walk(v node.Visitor) {
if v.Visit(n) == false {
if v.EnterNode(n) == false {
return
}
if n.variable != nil {
vv := v.Children("variable")
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
}
if n.expression != nil {
vv := v.Children("expression")
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
}
v.LeaveNode(n)
}

8
node/expr/assign_op/mul.go
View File

@@ -23,17 +23,19 @@ func NewMul(variable node.Node, expression node.Node) node.Node {
}
func (n Mul) Walk(v node.Visitor) {
if v.Visit(n) == false {
if v.EnterNode(n) == false {
return
}
if n.variable != nil {
vv := v.Children("variable")
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
}
if n.expression != nil {
vv := v.Children("expression")
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
}
v.LeaveNode(n)
}

8
node/expr/assign_op/plus.go
View File

@@ -23,17 +23,19 @@ func NewPlus(variable node.Node, expression node.Node) node.Node {
}
func (n Plus) Walk(v node.Visitor) {
if v.Visit(n) == false {
if v.EnterNode(n) == false {
return
}
if n.variable != nil {
vv := v.Children("variable")
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
}
if n.expression != nil {
vv := v.Children("expression")
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
}
v.LeaveNode(n)
}

8
node/expr/assign_op/pow.go
View File

@@ -23,17 +23,19 @@ func NewPow(variable node.Node, expression node.Node) node.Node {
}
func (n Pow) Walk(v node.Visitor) {
if v.Visit(n) == false {
if v.EnterNode(n) == false {
return
}
if n.variable != nil {
vv := v.Children("variable")
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
}
if n.expression != nil {
vv := v.Children("expression")
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
}
v.LeaveNode(n)
}

8
node/expr/assign_op/shift_left.go
View File

@@ -23,17 +23,19 @@ func NewShiftLeft(variable node.Node, expression node.Node) node.Node {
}
func (n ShiftLeft) Walk(v node.Visitor) {
if v.Visit(n) == false {
if v.EnterNode(n) == false {
return
}
if n.variable != nil {
vv := v.Children("variable")
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
}
if n.expression != nil {
vv := v.Children("expression")
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
}
v.LeaveNode(n)
}

8
node/expr/assign_op/shift_right.go
View File

@@ -23,17 +23,19 @@ func NewShiftRight(variable node.Node, expression node.Node) node.Node {
}
func (n ShiftRight) Walk(v node.Visitor) {
if v.Visit(n) == false {
if v.EnterNode(n) == false {
return
}
if n.variable != nil {
vv := v.Children("variable")
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
}
if n.expression != nil {
vv := v.Children("expression")
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
}
v.LeaveNode(n)
}