- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 12 for Stok (0.23 sec)
-
src/cmd/asm/internal/lex/tokenizer.go
s := t.s for { t.tok = ScanToken(s.Scan()) if t.tok != scanner.Comment { break } text := s.TokenText() t.line += strings.Count(text, "\n") if constraint.IsGoBuild(text) { t.tok = BuildComment break } } switch t.tok { case '\n': t.line++ case '-': if s.Peek() == '>' { s.Next() t.tok = ARR return ARR } case '@':
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Thu Aug 04 20:35:21 GMT 2022 - 3K bytes - Viewed (0) -
src/cmd/cgo/gcc.go
return true case *ast.Ident: // TODO: Handle types defined within function. for _, d := range p.Decl { gd, ok := d.(*ast.GenDecl) if !ok || gd.Tok != token.TYPE { continue } for _, spec := range gd.Specs { ts, ok := spec.(*ast.TypeSpec) if !ok { continue } if ts.Name.Name == t.Name {
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Thu Nov 02 16:43:23 GMT 2023 - 97K bytes - Viewed (0) -
api/go1.txt
pkg go/ast, type ArrayType struct, Len Expr pkg go/ast, type AssignStmt struct pkg go/ast, type AssignStmt struct, Lhs []Expr pkg go/ast, type AssignStmt struct, Rhs []Expr pkg go/ast, type AssignStmt struct, Tok token.Token pkg go/ast, type AssignStmt struct, TokPos token.Pos pkg go/ast, type BadDecl struct pkg go/ast, type BadDecl struct, From token.Pos pkg go/ast, type BadDecl struct, To token.Pos
Plain Text - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Wed Aug 14 18:58:28 GMT 2013 - 1.7M bytes - Viewed (1) -
src/cmd/asm/internal/lex/input.go
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())) } }
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Tue Aug 29 07:48:38 GMT 2023 - 12.6K bytes - Viewed (0) -
src/cmd/asm/internal/asm/parse.go
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 == ']' {
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Wed Feb 21 14:34:57 GMT 2024 - 36.9K bytes - Viewed (0) -
src/cmd/asm/internal/lex/lex_test.go
} // drain returns a single string representing the processed input tokens. func drain(input *Input) string { var buf strings.Builder for { tok := input.Next() if tok == scanner.EOF { return buf.String() } if tok == '#' { continue } if buf.Len() > 0 { buf.WriteByte('.') } buf.WriteString(input.Text()) } } type badLexTest struct {
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Tue Aug 29 07:48:38 GMT 2023 - 5.8K bytes - Viewed (0) -
src/cmd/asm/internal/lex/lex.go
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Tue Aug 29 18:31:05 GMT 2023 - 4.1K bytes - Viewed (0) -
src/cmd/asm/internal/asm/expr_test.go
result := int64(p.expr()) if result != test.output { t.Errorf("%d: %q evaluated to %d; expected %d", i, test.input, result, test.output) } tok := p.next() if test.atEOF && tok.ScanToken != scanner.EOF { t.Errorf("%d: %q: at EOF got %s", i, test.input, tok) } else if !test.atEOF && tok.ScanToken == scanner.EOF { t.Errorf("%d: %q: expected not EOF but at EOF", i, test.input) } } } type badExprTest struct {
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Tue Aug 29 07:48:38 GMT 2023 - 3.2K bytes - Viewed (0) -
src/cmd/cgo/godefs.go
refName := make(map[*ast.Expr]*Name) for _, r := range f.Ref { refName[r.Expr] = r.Name } for _, d := range f.AST.Decls { d, ok := d.(*ast.GenDecl) if !ok || d.Tok != token.TYPE { continue } for _, s := range d.Specs { s := s.(*ast.TypeSpec) n := refName[&s.Type] if n != nil && n.Mangle != "" { override[n.Mangle] = s.Name.Name } } }
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Thu Sep 08 14:33:35 GMT 2022 - 4.5K bytes - Viewed (0) -
src/cmd/asm/internal/lex/stack.go
s.tr = append(s.tr, tr) } func (s *Stack) Next() ScanToken { tos := s.tr[len(s.tr)-1] tok := tos.Next() for tok == scanner.EOF && len(s.tr) > 1 { tos.Close() // Pop the topmost item from the stack and resume with the next one down. s.tr = s.tr[:len(s.tr)-1] tok = s.Next() } return tok } func (s *Stack) Text() string { return s.tr[len(s.tr)-1].Text() }
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Mon Jan 09 22:33:23 GMT 2017 - 1.2K bytes - Viewed (0)