github.com/google/licensecheck/internal/match.reParser.stack (field)
41 uses
github.com/google/licensecheck/internal/match (current package)
resyntax.go#L177: stack []*reSyntax
resyntax.go#L299: p.stack = p.stack[:len(p.stack)-1]
resyntax.go#L303: n := len(p.stack)
resyntax.go#L307: return p.stack[0], nil
resyntax.go#L328: p.stack = append(p.stack, re)
resyntax.go#L351: if len(p.stack) > 0 && p.stack[len(p.stack)-1].op == opWords {
resyntax.go#L352: re = p.stack[len(p.stack)-1]
resyntax.go#L363: p.stack = append(p.stack, &reSyntax{op: opWords, w: []WordID{last.ID}})
resyntax.go#L386: n := len(p.stack)
resyntax.go#L388: re1 := p.stack[n-1]
resyntax.go#L389: re2 := p.stack[n-2]
resyntax.go#L391: p.stack[n-2] = re1
resyntax.go#L392: p.stack[n-1] = re2
resyntax.go#L404: p.stack = p.stack[:len(p.stack)-1]
resyntax.go#L408: n := len(p.stack)
resyntax.go#L412: re1 := p.stack[n-1]
resyntax.go#L413: re2 := p.stack[n-2]
resyntax.go#L414: p.stack = p.stack[:n-2]
resyntax.go#L425: n := len(p.stack)
resyntax.go#L429: sub := p.stack[n-1]
resyntax.go#L438: p.stack[n-1] = &reSyntax{op: opQuest, sub: []*reSyntax{sub}}
resyntax.go#L445: i := len(p.stack)
resyntax.go#L446: for i > 0 && p.stack[i-1].op < opPseudo {
resyntax.go#L449: subs := p.stack[i:]
resyntax.go#L450: p.stack = p.stack[:i]
resyntax.go#L464: i := len(p.stack)
resyntax.go#L465: for i > 0 && p.stack[i-1].op < opPseudo {
resyntax.go#L468: subs := p.stack[i:]
resyntax.go#L469: p.stack = p.stack[:i]
![]() |
The pages are generated with Golds v0.3.2-preview. (GOOS=darwin GOARCH=amd64) Golds is a Go 101 project developed by Tapir Liu. PR and bug reports are welcome and can be submitted to the issue list. Please follow @Go100and1 (reachable from the left QR code) to get the latest news of Golds. |