if tok == '\n' || tok == ';' || (nesting == 0 && (tok == ',' || tok == ':')) {
				if tok == ':' {
					// Remember this location so we can swap the operands below.
					if colon >= 0 {
						p.errorf("invalid ':' in operand")
						return word, cond, operands, true
					}
					colon = len(operands)
				}
				break
			}
			if tok == '(' || tok == '[' {
				nesting++
			}
			if tok == ')' || tok == ']' {

	nesting := 0
	var tokens []Token
	for {
		tok := in.Stack.Next()
		if tok == scanner.EOF || tok == '\n' {
			in.Error("unterminated arg list invoking macro:", macro.name)
		}
		if nesting == 0 && (tok == ')' || tok == ',') {
			return tokens, tok
		}
		if tok == '(' {
			nesting++
		}
		if tok == ')' {
			nesting--
		}
		tokens = append(tokens, Make(tok, in.Stack.Text()))
	}
}

                NegTokenInit tok = new NegTokenInit(initialToken);
                if (log.isDebugEnabled()) {
                    log.debug("Have initial token " + tok);
                }
                if (tok.getMechanisms() != null) {
                    Set<ASN1ObjectIdentifier> mechs = new HashSet<>(Arrays.asList(tok.getMechanisms()));

	}

	// nextToken gets the next token delimited by a newline. This assumes that
	// at least one newline exists in the buffer.
	nextToken := func() string {
		cntNewline--
		tok, _ := buf.ReadString('\n')
		return strings.TrimRight(tok, "\n")
	}

	// Parse for the number of entries.
	// Use integer overflow resistant math to check this.
	if err := feedTokens(1); err != nil {
		return nil, err
	}

Drop header comments. cmap[ast.Node(f)] = nil // Remove top-level consts used across the main and generated files. var newDecls []ast.Decl for _, decl := range f.Decls { switch d := decl.(type) { case *ast.GenDecl: if d.Tok == token.CONST { continue // Skip const declarations } if d.Tok == token.IMPORT { cmap[decl] = nil // Drop pre-import comments. } } newDecls = append(newDecls, decl) } f.Decls = newDecls // Replace identifiers. ast.Inspect(f, func(n ast.Node) bool { switch x := n.(type) { case *ast.Ident:...

Drop header comments. cmap[ast.Node(f)] = nil // Remove top-level consts used across the main and generated files. var newDecls []ast.Decl for _, decl := range f.Decls { switch d := decl.(type) { case *ast.GenDecl: if d.Tok == token.CONST { continue // Skip const declarations } if d.Tok == token.IMPORT { cmap[decl] = nil // Drop pre-import comments. } } newDecls = append(newDecls, decl) } f.Decls = newDecls // Replace identifiers. ast.Inspect(f, func(n ast.Node) bool { switch x := n.(type) { case *ast.Ident:...