If left recursive, return the left hand side, else return nullptr.
(expr ast.Node)
| 93 | |
| 94 | // If left recursive, return the left hand side, else return nullptr. |
| 95 | func leftRecursive(expr ast.Node) ast.Node { |
| 96 | switch node := expr.(type) { |
| 97 | case *ast.Apply: |
| 98 | return node.Target |
| 99 | case *ast.ApplyBrace: |
| 100 | return node.Left |
| 101 | case *ast.Binary: |
| 102 | return node.Left |
| 103 | case *ast.Index: |
| 104 | return node.Target |
| 105 | case *ast.InSuper: |
| 106 | return node.Index |
| 107 | case *ast.Slice: |
| 108 | return node.Target |
| 109 | default: |
| 110 | return nil |
| 111 | } |
| 112 | } |
| 113 | |
| 114 | // leftRecursiveDeep is the transitive closure of leftRecursive. |
| 115 | // It only returns nil when called with nil. |
no outgoing calls
no test coverage detected
searching dependent graphs…