mirror of
https://github.com/golang/go
synced 2024-10-03 16:41:28 -06:00
1829 lines
38 KiB
Go
1829 lines
38 KiB
Go
// Copyright 2009 The Go Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
// A parser for Go source text. The input is a stream of lexical tokens
|
|
// provided via the Scanner interface. The output is an abstract syntax
|
|
// tree (AST) representing the Go source.
|
|
//
|
|
package parser
|
|
|
|
import (
|
|
"fmt";
|
|
"vector";
|
|
"token";
|
|
"ast";
|
|
)
|
|
|
|
|
|
type interval struct {
|
|
beg, end int;
|
|
}
|
|
|
|
|
|
// An implementation of a Scanner must be provided to the Parser.
|
|
// The parser calls Scan() repeatedly until token.EOF is returned.
|
|
// Scan must return the current token position pos, the token value
|
|
// tok, and the corresponding token literal string lit if the token
|
|
// is a literal (i.e., if tok.IsLiteral() is true).
|
|
//
|
|
type Scanner interface {
|
|
Scan() (pos token.Position, tok token.Token, lit []byte);
|
|
}
|
|
|
|
|
|
// An implementation of an ErrorHandler must be provided to the parser.
|
|
// If a syntax error is encountered, Error is called with a position and
|
|
// an error message. The position points to the beginning of the offending
|
|
// token.
|
|
//
|
|
type ErrorHandler interface {
|
|
Error(pos token.Position, msg string);
|
|
}
|
|
|
|
|
|
// The following flags control optional parser functionality. A set of
|
|
// flags (or 0) must be provided as a parameter to the Parse function.
|
|
//
|
|
const (
|
|
Trace = 1 << iota;
|
|
)
|
|
|
|
|
|
// The parser structure holds the parser's internal state.
|
|
type parser struct {
|
|
scanner Scanner;
|
|
err ErrorHandler;
|
|
|
|
// Tracing/debugging
|
|
trace bool;
|
|
indent uint;
|
|
|
|
comments vector.Vector; // list of collected, unassociated comments
|
|
last_doc interval; // last comments interval of consecutive comments
|
|
|
|
// The next token
|
|
pos token.Position; // token location
|
|
tok token.Token; // one token look-ahead
|
|
lit []byte; // token literal
|
|
|
|
// Non-syntactic parser control
|
|
opt_semi bool; // true if semicolon separator is optional in statement list
|
|
expr_lev int; // < 0: in control clause, >= 0: in expression
|
|
};
|
|
|
|
|
|
// When we don't have a location use nopos.
|
|
// TODO make sure we always have a location.
|
|
var nopos token.Position;
|
|
|
|
|
|
// ----------------------------------------------------------------------------
|
|
// Helper functions
|
|
|
|
func unreachable() {
|
|
panic("unreachable");
|
|
}
|
|
|
|
|
|
// ----------------------------------------------------------------------------
|
|
// Parsing support
|
|
|
|
func (P *parser) printIndent() {
|
|
i := P.indent;
|
|
// reduce printing time by a factor of 2 or more
|
|
for ; i > 10; i -= 10 {
|
|
fmt.Printf(". . . . . . . . . . ");
|
|
}
|
|
for ; i > 0; i-- {
|
|
fmt.Printf(". ");
|
|
}
|
|
}
|
|
|
|
|
|
func trace(P *parser, msg string) *parser {
|
|
P.printIndent();
|
|
fmt.Printf("%s (\n", msg);
|
|
P.indent++;
|
|
return P;
|
|
}
|
|
|
|
|
|
func un/*trace*/(P *parser) {
|
|
P.indent--;
|
|
P.printIndent();
|
|
fmt.Printf(")\n");
|
|
}
|
|
|
|
|
|
func (P *parser) next0() {
|
|
P.pos, P.tok, P.lit = P.scanner.Scan();
|
|
P.opt_semi = false;
|
|
|
|
if P.trace {
|
|
P.printIndent();
|
|
switch P.tok {
|
|
case token.IDENT, token.INT, token.FLOAT, token.CHAR, token.STRING:
|
|
fmt.Printf("%d:%d: %s = %s\n", P.pos.Line, P.pos.Column, P.tok.String(), P.lit);
|
|
case token.LPAREN:
|
|
// don't print '(' - screws up selection in terminal window
|
|
fmt.Printf("%d:%d: LPAREN\n", P.pos.Line, P.pos.Column);
|
|
case token.RPAREN:
|
|
// don't print ')' - screws up selection in terminal window
|
|
fmt.Printf("%d:%d: RPAREN\n", P.pos.Line, P.pos.Column);
|
|
default:
|
|
fmt.Printf("%d:%d: %s\n", P.pos.Line, P.pos.Column, P.tok.String());
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
// Collect a comment in the parser's comment list and return the line
|
|
// on which the comment ends.
|
|
func (P *parser) collectComment() int {
|
|
// For /*-style comments, the comment may end on a different line.
|
|
// Scan the comment for '\n' chars and adjust the end line accordingly.
|
|
// (Note that the position of the next token may be even further down
|
|
// as there may be more whitespace lines after the comment.)
|
|
endline := P.pos.Line;
|
|
if P.lit[1] == '*' {
|
|
for i, b := range P.lit {
|
|
if b == '\n' {
|
|
endline++;
|
|
}
|
|
}
|
|
}
|
|
P.comments.Push(&ast.Comment{P.pos, P.lit, endline});
|
|
P.next0();
|
|
|
|
return endline;
|
|
}
|
|
|
|
|
|
func (P *parser) getComments() interval {
|
|
// group adjacent comments, an empty line terminates a group
|
|
beg := P.comments.Len();
|
|
endline := P.pos.Line;
|
|
for P.tok == token.COMMENT && endline+1 >= P.pos.Line {
|
|
endline = P.collectComment();
|
|
}
|
|
end := P.comments.Len();
|
|
return interval {beg, end};
|
|
}
|
|
|
|
|
|
func (P *parser) next() {
|
|
P.next0();
|
|
P.last_doc = interval{0, 0};
|
|
for P.tok == token.COMMENT {
|
|
P.last_doc = P.getComments();
|
|
}
|
|
}
|
|
|
|
|
|
func (P *parser) error(pos token.Position, msg string) {
|
|
P.err.Error(pos, msg);
|
|
}
|
|
|
|
|
|
func (P *parser) expect(tok token.Token) token.Position {
|
|
if P.tok != tok {
|
|
msg := "expected '" + tok.String() + "', found '" + P.tok.String() + "'";
|
|
if P.tok.IsLiteral() {
|
|
msg += " " + string(P.lit);
|
|
}
|
|
P.error(P.pos, msg);
|
|
}
|
|
loc := P.pos;
|
|
P.next(); // make progress in any case
|
|
return loc;
|
|
}
|
|
|
|
|
|
func (P *parser) getDoc() ast.Comments {
|
|
doc := P.last_doc;
|
|
n := doc.end - doc.beg;
|
|
|
|
if n <= 0 || P.comments.At(doc.end - 1).(*ast.Comment).EndLine + 1 < P.pos.Line {
|
|
// no comments or empty line between last comment and current token;
|
|
// do not use as documentation
|
|
return nil;
|
|
}
|
|
|
|
// found immediately adjacent comment interval;
|
|
// use as documentation
|
|
c := make(ast.Comments, n);
|
|
for i := 0; i < n; i++ {
|
|
c[i] = P.comments.At(doc.beg + i).(*ast.Comment);
|
|
// TODO find a better way to do this
|
|
P.comments.Set(doc.beg + i, nil); // remove the comment from the general list
|
|
}
|
|
return c;
|
|
}
|
|
|
|
|
|
// ----------------------------------------------------------------------------
|
|
// Common productions
|
|
|
|
func (P *parser) tryType() ast.Expr;
|
|
func (P *parser) parseExpression(prec int) ast.Expr;
|
|
func (P *parser) parseStatement() ast.Stmt;
|
|
func (P *parser) parseDeclaration() ast.Decl;
|
|
|
|
|
|
func (P *parser) parseIdent() *ast.Ident {
|
|
if P.trace {
|
|
defer un(trace(P, "Ident"));
|
|
}
|
|
|
|
if P.tok == token.IDENT {
|
|
x := &ast.Ident{P.pos, P.lit};
|
|
P.next();
|
|
return x;
|
|
}
|
|
P.expect(token.IDENT); // use expect() error handling
|
|
|
|
return &ast.Ident{P.pos, [0]byte{}};
|
|
}
|
|
|
|
|
|
func (P *parser) parseIdentList(x ast.Expr) []*ast.Ident {
|
|
if P.trace {
|
|
defer un(trace(P, "IdentList"));
|
|
}
|
|
|
|
list := vector.New(0);
|
|
if x == nil {
|
|
x = P.parseIdent();
|
|
}
|
|
list.Push(x);
|
|
for P.tok == token.COMMA {
|
|
P.next();
|
|
list.Push(P.parseIdent());
|
|
}
|
|
|
|
// convert vector
|
|
idents := make([]*ast.Ident, list.Len());
|
|
for i := 0; i < list.Len(); i++ {
|
|
idents[i] = list.At(i).(*ast.Ident);
|
|
}
|
|
|
|
return idents;
|
|
}
|
|
|
|
|
|
func (P *parser) parseExpressionList() []ast.Expr {
|
|
if P.trace {
|
|
defer un(trace(P, "ExpressionList"));
|
|
}
|
|
|
|
list := vector.New(0);
|
|
list.Push(P.parseExpression(1));
|
|
for P.tok == token.COMMA {
|
|
P.next();
|
|
list.Push(P.parseExpression(1));
|
|
}
|
|
|
|
// convert list
|
|
exprs := make([]ast.Expr, list.Len());
|
|
for i := 0; i < list.Len(); i++ {
|
|
exprs[i] = list.At(i).(ast.Expr);
|
|
}
|
|
|
|
return exprs;
|
|
}
|
|
|
|
|
|
// ----------------------------------------------------------------------------
|
|
// Types
|
|
|
|
func (P *parser) parseType() ast.Expr {
|
|
if P.trace {
|
|
defer un(trace(P, "Type"));
|
|
}
|
|
|
|
typ := P.tryType();
|
|
if typ == nil {
|
|
P.error(P.pos, "type expected");
|
|
typ = &ast.BadExpr{P.pos};
|
|
}
|
|
|
|
return typ;
|
|
}
|
|
|
|
|
|
func (P *parser) parseVarType() ast.Expr {
|
|
if P.trace {
|
|
defer un(trace(P, "VarType"));
|
|
}
|
|
|
|
return P.parseType();
|
|
}
|
|
|
|
|
|
func (P *parser) parseQualifiedIdent() ast.Expr {
|
|
if P.trace {
|
|
defer un(trace(P, "QualifiedIdent"));
|
|
}
|
|
|
|
var x ast.Expr = P.parseIdent();
|
|
for P.tok == token.PERIOD {
|
|
P.next();
|
|
sel := P.parseIdent();
|
|
x = &ast.SelectorExpr{x, sel};
|
|
}
|
|
return x;
|
|
}
|
|
|
|
|
|
func (P *parser) parseTypeName() ast.Expr {
|
|
if P.trace {
|
|
defer un(trace(P, "TypeName"));
|
|
}
|
|
|
|
return P.parseQualifiedIdent();
|
|
}
|
|
|
|
|
|
func (P *parser) parseArrayType() *ast.ArrayType {
|
|
if P.trace {
|
|
defer un(trace(P, "ArrayType"));
|
|
}
|
|
|
|
lbrack := P.expect(token.LBRACK);
|
|
var len ast.Expr;
|
|
if P.tok == token.ELLIPSIS {
|
|
len = &ast.Ellipsis{P.pos};
|
|
P.next();
|
|
} else if P.tok != token.RBRACK {
|
|
len = P.parseExpression(1);
|
|
}
|
|
P.expect(token.RBRACK);
|
|
elt := P.parseType();
|
|
|
|
return &ast.ArrayType{lbrack, len, elt};
|
|
}
|
|
|
|
|
|
func (P *parser) parseChannelType() *ast.ChannelType {
|
|
if P.trace {
|
|
defer un(trace(P, "ChannelType"));
|
|
}
|
|
|
|
pos := P.pos;
|
|
dir := ast.SEND | ast.RECV;
|
|
if P.tok == token.CHAN {
|
|
P.next();
|
|
if P.tok == token.ARROW {
|
|
P.next();
|
|
dir = ast.SEND;
|
|
}
|
|
} else {
|
|
P.expect(token.ARROW);
|
|
P.expect(token.CHAN);
|
|
dir = ast.RECV;
|
|
}
|
|
value := P.parseVarType();
|
|
|
|
return &ast.ChannelType{pos, dir, value};
|
|
}
|
|
|
|
|
|
func (P *parser) tryParameterType() ast.Expr {
|
|
if P.tok == token.ELLIPSIS {
|
|
loc := P.pos;
|
|
P.next();
|
|
return &ast.Ellipsis{loc};
|
|
}
|
|
return P.tryType();
|
|
}
|
|
|
|
|
|
func (P *parser) parseParameterType() ast.Expr {
|
|
typ := P.tryParameterType();
|
|
if typ == nil {
|
|
P.error(P.pos, "type expected");
|
|
typ = &ast.BadExpr{P.pos};
|
|
}
|
|
|
|
return typ;
|
|
}
|
|
|
|
|
|
func (P *parser) parseParameterDecl(ellipsis_ok bool) (*vector.Vector, ast.Expr) {
|
|
if P.trace {
|
|
defer un(trace(P, "ParameterDecl"));
|
|
}
|
|
|
|
// a list of identifiers looks like a list of type names
|
|
list := vector.New(0);
|
|
for {
|
|
// TODO do not allow ()'s here
|
|
list.Push(P.parseParameterType());
|
|
if P.tok == token.COMMA {
|
|
P.next();
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
|
|
// if we had a list of identifiers, it must be followed by a type
|
|
typ := P.tryParameterType();
|
|
|
|
return list, typ;
|
|
}
|
|
|
|
|
|
func (P *parser) parseParameterList(ellipsis_ok bool) []*ast.Field {
|
|
if P.trace {
|
|
defer un(trace(P, "ParameterList"));
|
|
}
|
|
|
|
list, typ := P.parseParameterDecl(false);
|
|
if typ != nil {
|
|
// IdentifierList Type
|
|
// convert list of identifiers into []*Ident
|
|
idents := make([]*ast.Ident, list.Len());
|
|
for i := 0; i < list.Len(); i++ {
|
|
idents[i] = list.At(i).(*ast.Ident);
|
|
}
|
|
list.Init(0);
|
|
list.Push(&ast.Field{nil, idents, typ, nil});
|
|
|
|
for P.tok == token.COMMA {
|
|
P.next();
|
|
idents := P.parseIdentList(nil);
|
|
typ := P.parseParameterType();
|
|
list.Push(&ast.Field{nil, idents, typ, nil});
|
|
}
|
|
|
|
} else {
|
|
// Type { "," Type }
|
|
// convert list of types into list of *Param
|
|
for i := 0; i < list.Len(); i++ {
|
|
list.Set(i, &ast.Field{nil, nil, list.At(i).(ast.Expr), nil});
|
|
}
|
|
}
|
|
|
|
// convert list
|
|
params := make([]*ast.Field, list.Len());
|
|
for i := 0; i < list.Len(); i++ {
|
|
params[i] = list.At(i).(*ast.Field);
|
|
}
|
|
|
|
return params;
|
|
}
|
|
|
|
|
|
// TODO make sure Go spec is updated
|
|
func (P *parser) parseParameters(ellipsis_ok bool) []*ast.Field {
|
|
if P.trace {
|
|
defer un(trace(P, "Parameters"));
|
|
}
|
|
|
|
var params []*ast.Field;
|
|
P.expect(token.LPAREN);
|
|
if P.tok != token.RPAREN {
|
|
params = P.parseParameterList(ellipsis_ok);
|
|
}
|
|
P.expect(token.RPAREN);
|
|
|
|
return params;
|
|
}
|
|
|
|
|
|
func (P *parser) parseResult() []*ast.Field {
|
|
if P.trace {
|
|
defer un(trace(P, "Result"));
|
|
}
|
|
|
|
var results []*ast.Field;
|
|
if P.tok == token.LPAREN {
|
|
results = P.parseParameters(false);
|
|
} else if P.tok != token.FUNC {
|
|
typ := P.tryType();
|
|
if typ != nil {
|
|
results = make([]*ast.Field, 1);
|
|
results[0] = &ast.Field{nil, nil, typ, nil};
|
|
}
|
|
}
|
|
|
|
return results;
|
|
}
|
|
|
|
|
|
// Function types
|
|
//
|
|
// (params)
|
|
// (params) type
|
|
// (params) (results)
|
|
|
|
func (P *parser) parseSignature() (params []*ast.Field, results []*ast.Field) {
|
|
if P.trace {
|
|
defer un(trace(P, "Signature"));
|
|
}
|
|
|
|
params = P.parseParameters(true); // TODO find better solution
|
|
results = P.parseResult();
|
|
|
|
return params, results;
|
|
}
|
|
|
|
|
|
func (P *parser) parseFunctionType() *ast.FunctionType {
|
|
if P.trace {
|
|
defer un(trace(P, "FunctionType"));
|
|
}
|
|
|
|
pos := P.expect(token.FUNC);
|
|
params, results := P.parseSignature();
|
|
|
|
return &ast.FunctionType{pos, params, results};
|
|
}
|
|
|
|
|
|
func (P *parser) parseMethodSpec() *ast.Field {
|
|
if P.trace {
|
|
defer un(trace(P, "MethodSpec"));
|
|
}
|
|
|
|
doc := P.getDoc();
|
|
var idents []*ast.Ident;
|
|
var typ ast.Expr;
|
|
x := P.parseQualifiedIdent();
|
|
if tmp, is_ident := x.(*ast.Ident); is_ident && (P.tok == token.COMMA || P.tok == token.LPAREN) {
|
|
// method(s)
|
|
idents = P.parseIdentList(x);
|
|
params, results := P.parseSignature();
|
|
typ = &ast.FunctionType{nopos, params, results};
|
|
} else {
|
|
// embedded interface
|
|
typ = x;
|
|
}
|
|
|
|
return &ast.Field{doc, idents, typ, nil};
|
|
}
|
|
|
|
|
|
func (P *parser) parseInterfaceType() *ast.InterfaceType {
|
|
if P.trace {
|
|
defer un(trace(P, "InterfaceType"));
|
|
}
|
|
|
|
pos := P.expect(token.INTERFACE);
|
|
var lbrace, rbrace token.Position;
|
|
var methods []*ast.Field;
|
|
if P.tok == token.LBRACE {
|
|
lbrace = P.pos;
|
|
P.next();
|
|
|
|
list := vector.New(0);
|
|
for P.tok == token.IDENT {
|
|
list.Push(P.parseMethodSpec());
|
|
if P.tok != token.RBRACE {
|
|
P.expect(token.SEMICOLON);
|
|
}
|
|
}
|
|
|
|
rbrace = P.expect(token.RBRACE);
|
|
P.opt_semi = true;
|
|
|
|
// convert vector
|
|
methods = make([]*ast.Field, list.Len());
|
|
for i := list.Len() - 1; i >= 0; i-- {
|
|
methods[i] = list.At(i).(*ast.Field);
|
|
}
|
|
}
|
|
|
|
return &ast.InterfaceType{pos, lbrace, methods, rbrace};
|
|
}
|
|
|
|
|
|
func (P *parser) parseMapType() *ast.MapType {
|
|
if P.trace {
|
|
defer un(trace(P, "MapType"));
|
|
}
|
|
|
|
pos := P.expect(token.MAP);
|
|
P.expect(token.LBRACK);
|
|
key := P.parseVarType();
|
|
P.expect(token.RBRACK);
|
|
value := P.parseVarType();
|
|
|
|
return &ast.MapType{pos, key, value};
|
|
}
|
|
|
|
|
|
func (P *parser) parseStringList(x *ast.StringLit) []*ast.StringLit
|
|
|
|
func (P *parser) parseFieldDecl() *ast.Field {
|
|
if P.trace {
|
|
defer un(trace(P, "FieldDecl"));
|
|
}
|
|
|
|
doc := P.getDoc();
|
|
|
|
// a list of identifiers looks like a list of type names
|
|
list := vector.New(0);
|
|
for {
|
|
// TODO do not allow ()'s here
|
|
list.Push(P.parseType());
|
|
if P.tok == token.COMMA {
|
|
P.next();
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
|
|
// if we had a list of identifiers, it must be followed by a type
|
|
typ := P.tryType();
|
|
|
|
// optional tag
|
|
var tag []*ast.StringLit;
|
|
if P.tok == token.STRING {
|
|
tag = P.parseStringList(nil);
|
|
}
|
|
|
|
// analyze case
|
|
var idents []*ast.Ident;
|
|
if typ != nil {
|
|
// non-empty identifier list followed by a type
|
|
idents = make([]*ast.Ident, list.Len());
|
|
for i := 0; i < list.Len(); i++ {
|
|
if ident, is_ident := list.At(i).(*ast.Ident); is_ident {
|
|
idents[i] = ident;
|
|
} else {
|
|
P.error(list.At(i).(ast.Expr).Pos(), "identifier expected");
|
|
}
|
|
}
|
|
} else {
|
|
// anonymous field
|
|
if list.Len() == 1 {
|
|
// TODO should do more checks here
|
|
typ = list.At(0).(ast.Expr);
|
|
} else {
|
|
P.error(P.pos, "anonymous field expected");
|
|
}
|
|
}
|
|
|
|
return &ast.Field{doc, idents, typ, tag};
|
|
}
|
|
|
|
|
|
func (P *parser) parseStructType() *ast.StructType {
|
|
if P.trace {
|
|
defer un(trace(P, "StructType"));
|
|
}
|
|
|
|
pos := P.expect(token.STRUCT);
|
|
var lbrace, rbrace token.Position;
|
|
var fields []*ast.Field;
|
|
if P.tok == token.LBRACE {
|
|
lbrace = P.pos;
|
|
P.next();
|
|
|
|
list := vector.New(0);
|
|
for P.tok != token.RBRACE && P.tok != token.EOF {
|
|
list.Push(P.parseFieldDecl());
|
|
if P.tok == token.SEMICOLON {
|
|
P.next();
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
if P.tok == token.SEMICOLON {
|
|
P.next();
|
|
}
|
|
|
|
rbrace = P.expect(token.RBRACE);
|
|
P.opt_semi = true;
|
|
|
|
// convert vector
|
|
fields = make([]*ast.Field, list.Len());
|
|
for i := list.Len() - 1; i >= 0; i-- {
|
|
fields[i] = list.At(i).(*ast.Field);
|
|
}
|
|
}
|
|
|
|
return &ast.StructType{pos, lbrace, fields, rbrace};
|
|
}
|
|
|
|
|
|
func (P *parser) parsePointerType() *ast.StarExpr {
|
|
if P.trace {
|
|
defer un(trace(P, "PointerType"));
|
|
}
|
|
|
|
star := P.expect(token.MUL);
|
|
base := P.parseType();
|
|
|
|
return &ast.StarExpr{star, base};
|
|
}
|
|
|
|
|
|
func (P *parser) tryType() ast.Expr {
|
|
if P.trace {
|
|
defer un(trace(P, "Type (try)"));
|
|
}
|
|
|
|
switch P.tok {
|
|
case token.IDENT: return P.parseTypeName();
|
|
case token.LBRACK: return P.parseArrayType();
|
|
case token.CHAN, token.ARROW: return P.parseChannelType();
|
|
case token.INTERFACE: return P.parseInterfaceType();
|
|
case token.FUNC: return P.parseFunctionType();
|
|
case token.MAP: return P.parseMapType();
|
|
case token.STRUCT: return P.parseStructType();
|
|
case token.MUL: return P.parsePointerType();
|
|
case token.LPAREN:
|
|
lparen := P.pos;
|
|
P.next();
|
|
x := P.parseType();
|
|
rparen := P.expect(token.RPAREN);
|
|
return &ast.ParenExpr{lparen, x, rparen};
|
|
}
|
|
|
|
// no type found
|
|
return nil;
|
|
}
|
|
|
|
|
|
// ----------------------------------------------------------------------------
|
|
// Blocks
|
|
|
|
func asStmtList(list *vector.Vector) []ast.Stmt {
|
|
stats := make([]ast.Stmt, list.Len());
|
|
for i := 0; i < list.Len(); i++ {
|
|
stats[i] = list.At(i).(ast.Stmt);
|
|
}
|
|
return stats;
|
|
}
|
|
|
|
|
|
func (P *parser) parseStatementList() []ast.Stmt {
|
|
if P.trace {
|
|
defer un(trace(P, "StatementList"));
|
|
}
|
|
|
|
list := vector.New(0);
|
|
expect_semi := false;
|
|
for P.tok != token.CASE && P.tok != token.DEFAULT && P.tok != token.RBRACE && P.tok != token.EOF {
|
|
if expect_semi {
|
|
P.expect(token.SEMICOLON);
|
|
expect_semi = false;
|
|
}
|
|
list.Push(P.parseStatement());
|
|
if P.tok == token.SEMICOLON {
|
|
P.next();
|
|
} else if P.opt_semi {
|
|
P.opt_semi = false; // "consume" optional semicolon
|
|
} else {
|
|
expect_semi = true;
|
|
}
|
|
}
|
|
|
|
return asStmtList(list);
|
|
}
|
|
|
|
|
|
func (P *parser) parseBlockStmt() *ast.BlockStmt {
|
|
if P.trace {
|
|
defer un(trace(P, "compositeStmt"));
|
|
}
|
|
|
|
lbrace := P.expect(token.LBRACE);
|
|
list := P.parseStatementList();
|
|
rbrace := P.expect(token.RBRACE);
|
|
P.opt_semi = true;
|
|
|
|
return &ast.BlockStmt{lbrace, list, rbrace};
|
|
}
|
|
|
|
|
|
// ----------------------------------------------------------------------------
|
|
// Expressions
|
|
|
|
func (P *parser) parseFunctionLit() ast.Expr {
|
|
if P.trace {
|
|
defer un(trace(P, "FunctionLit"));
|
|
}
|
|
|
|
typ := P.parseFunctionType();
|
|
P.expr_lev++;
|
|
body := P.parseBlockStmt();
|
|
P.expr_lev--;
|
|
|
|
return &ast.FunctionLit{typ, body};
|
|
}
|
|
|
|
|
|
func (P *parser) parseStringList(x *ast.StringLit) []*ast.StringLit {
|
|
if P.trace {
|
|
defer un(trace(P, "StringList"));
|
|
}
|
|
|
|
list := vector.New(0);
|
|
if x != nil {
|
|
list.Push(x);
|
|
}
|
|
|
|
for P.tok == token.STRING {
|
|
list.Push(&ast.StringLit{P.pos, P.lit});
|
|
P.next();
|
|
}
|
|
|
|
// convert list
|
|
strings := make([]*ast.StringLit, list.Len());
|
|
for i := 0; i < list.Len(); i++ {
|
|
strings[i] = list.At(i).(*ast.StringLit);
|
|
}
|
|
|
|
return strings;
|
|
}
|
|
|
|
|
|
func (P *parser) parseOperand() ast.Expr {
|
|
if P.trace {
|
|
defer un(trace(P, "Operand"));
|
|
}
|
|
|
|
switch P.tok {
|
|
case token.IDENT:
|
|
return P.parseIdent();
|
|
|
|
case token.INT:
|
|
x := &ast.IntLit{P.pos, P.lit};
|
|
P.next();
|
|
return x;
|
|
|
|
case token.FLOAT:
|
|
x := &ast.FloatLit{P.pos, P.lit};
|
|
P.next();
|
|
return x;
|
|
|
|
case token.CHAR:
|
|
x := &ast.CharLit{P.pos, P.lit};
|
|
P.next();
|
|
return x;
|
|
|
|
case token.STRING:
|
|
x := &ast.StringLit{P.pos, P.lit};
|
|
P.next();
|
|
if P.tok == token.STRING {
|
|
return &ast.StringList{P.parseStringList(x)};
|
|
}
|
|
return x;
|
|
|
|
case token.LPAREN:
|
|
lparen := P.pos;
|
|
P.next();
|
|
P.expr_lev++;
|
|
x := P.parseExpression(1);
|
|
P.expr_lev--;
|
|
rparen := P.expect(token.RPAREN);
|
|
return &ast.ParenExpr{lparen, x, rparen};
|
|
|
|
case token.FUNC:
|
|
return P.parseFunctionLit();
|
|
|
|
default:
|
|
t := P.tryType();
|
|
if t != nil {
|
|
return t;
|
|
} else {
|
|
P.error(P.pos, "operand expected");
|
|
P.next(); // make progress
|
|
}
|
|
}
|
|
|
|
return &ast.BadExpr{P.pos};
|
|
}
|
|
|
|
|
|
func (P *parser) parseSelectorOrTypeAssertion(x ast.Expr) ast.Expr {
|
|
if P.trace {
|
|
defer un(trace(P, "SelectorOrTypeAssertion"));
|
|
}
|
|
|
|
P.expect(token.PERIOD);
|
|
if P.tok == token.IDENT {
|
|
// selector
|
|
sel := P.parseIdent();
|
|
return &ast.SelectorExpr{x, sel};
|
|
|
|
} else {
|
|
// type assertion
|
|
P.expect(token.LPAREN);
|
|
var typ ast.Expr;
|
|
if P.tok == token.TYPE {
|
|
// special case for type switch syntax
|
|
typ = &ast.Ident{P.pos, P.lit};
|
|
P.next();
|
|
} else {
|
|
typ = P.parseType();
|
|
}
|
|
P.expect(token.RPAREN);
|
|
return &ast.TypeAssertExpr{x, typ};
|
|
}
|
|
|
|
unreachable();
|
|
return nil;
|
|
}
|
|
|
|
|
|
func (P *parser) parseIndexOrSlice(x ast.Expr) ast.Expr {
|
|
if P.trace {
|
|
defer un(trace(P, "IndexOrSlice"));
|
|
}
|
|
|
|
P.expect(token.LBRACK);
|
|
P.expr_lev++;
|
|
index := P.parseExpression(1);
|
|
P.expr_lev--;
|
|
|
|
if P.tok == token.RBRACK {
|
|
// index
|
|
P.next();
|
|
return &ast.IndexExpr{x, index};
|
|
}
|
|
|
|
// slice
|
|
P.expect(token.COLON);
|
|
P.expr_lev++;
|
|
end := P.parseExpression(1);
|
|
P.expr_lev--;
|
|
P.expect(token.RBRACK);
|
|
return &ast.SliceExpr{x, index, end};
|
|
}
|
|
|
|
|
|
func (P *parser) parseCall(fun ast.Expr) *ast.CallExpr {
|
|
if P.trace {
|
|
defer un(trace(P, "Call"));
|
|
}
|
|
|
|
lparen := P.expect(token.LPAREN);
|
|
var args []ast.Expr;
|
|
if P.tok != token.RPAREN {
|
|
args = P.parseExpressionList();
|
|
}
|
|
rparen := P.expect(token.RPAREN);
|
|
return &ast.CallExpr{fun, lparen, args, rparen};
|
|
}
|
|
|
|
|
|
func (P *parser) parseElementList() []ast.Expr {
|
|
if P.trace {
|
|
defer un(trace(P, "ElementList"));
|
|
}
|
|
|
|
list := vector.New(0);
|
|
singles := true;
|
|
for P.tok != token.RBRACE {
|
|
x := P.parseExpression(0);
|
|
if list.Len() == 0 {
|
|
// first element determines syntax for remaining elements
|
|
if t, is_binary := x.(*ast.BinaryExpr); is_binary && t.Op == token.COLON {
|
|
singles = false;
|
|
}
|
|
} else {
|
|
// not the first element - check syntax
|
|
if singles {
|
|
if t, is_binary := x.(*ast.BinaryExpr); is_binary && t.Op == token.COLON {
|
|
P.error(t.X.Pos(), "single value expected; found pair");
|
|
}
|
|
} else {
|
|
if t, is_binary := x.(*ast.BinaryExpr); !is_binary || t.Op != token.COLON {
|
|
P.error(x.Pos(), "key:value pair expected; found single value");
|
|
}
|
|
}
|
|
}
|
|
|
|
list.Push(x);
|
|
|
|
if P.tok == token.COMMA {
|
|
P.next();
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
|
|
// convert list
|
|
elts := make([]ast.Expr, list.Len());
|
|
for i := 0; i < list.Len(); i++ {
|
|
elts[i] = list.At(i).(ast.Expr);
|
|
}
|
|
|
|
return elts;
|
|
}
|
|
|
|
|
|
func (P *parser) parseCompositeLit(typ ast.Expr) ast.Expr {
|
|
if P.trace {
|
|
defer un(trace(P, "CompositeLit"));
|
|
}
|
|
|
|
lbrace := P.expect(token.LBRACE);
|
|
var elts []ast.Expr;
|
|
if P.tok != token.RBRACE {
|
|
elts = P.parseElementList();
|
|
}
|
|
rbrace := P.expect(token.RBRACE);
|
|
return &ast.CompositeLit{typ, lbrace, elts, rbrace};
|
|
}
|
|
|
|
|
|
func (P *parser) parsePrimaryExpr() ast.Expr {
|
|
if P.trace {
|
|
defer un(trace(P, "PrimaryExpr"));
|
|
}
|
|
|
|
x := P.parseOperand();
|
|
for {
|
|
switch P.tok {
|
|
case token.PERIOD: x = P.parseSelectorOrTypeAssertion(x);
|
|
case token.LBRACK: x = P.parseIndexOrSlice(x);
|
|
case token.LPAREN: x = P.parseCall(x);
|
|
case token.LBRACE:
|
|
if P.expr_lev >= 0 {
|
|
x = P.parseCompositeLit(x);
|
|
} else {
|
|
return x;
|
|
}
|
|
default:
|
|
return x;
|
|
}
|
|
}
|
|
|
|
unreachable();
|
|
return nil;
|
|
}
|
|
|
|
|
|
func (P *parser) parseUnaryExpr() ast.Expr {
|
|
if P.trace {
|
|
defer un(trace(P, "UnaryExpr"));
|
|
}
|
|
|
|
switch P.tok {
|
|
case token.ADD, token.SUB, token.NOT, token.XOR, token.ARROW, token.AND, token.RANGE:
|
|
pos, tok := P.pos, P.tok;
|
|
P.next();
|
|
x := P.parseUnaryExpr();
|
|
return &ast.UnaryExpr{pos, tok, x};
|
|
|
|
case token.MUL:
|
|
// unary "*" expression or pointer type
|
|
pos := P.pos;
|
|
P.next();
|
|
x := P.parseUnaryExpr();
|
|
return &ast.StarExpr{pos, x};
|
|
}
|
|
|
|
return P.parsePrimaryExpr();
|
|
}
|
|
|
|
|
|
func (P *parser) parseBinaryExpr(prec1 int) ast.Expr {
|
|
if P.trace {
|
|
defer un(trace(P, "BinaryExpr"));
|
|
}
|
|
|
|
x := P.parseUnaryExpr();
|
|
for prec := P.tok.Precedence(); prec >= prec1; prec-- {
|
|
for P.tok.Precedence() == prec {
|
|
pos, tok := P.pos, P.tok;
|
|
P.next();
|
|
y := P.parseBinaryExpr(prec + 1);
|
|
x = &ast.BinaryExpr{x, pos, tok, y};
|
|
}
|
|
}
|
|
|
|
return x;
|
|
}
|
|
|
|
|
|
func (P *parser) parseExpression(prec int) ast.Expr {
|
|
if P.trace {
|
|
defer un(trace(P, "Expression"));
|
|
}
|
|
|
|
if prec < 0 {
|
|
panic("precedence must be >= 0");
|
|
}
|
|
|
|
return P.parseBinaryExpr(prec);
|
|
}
|
|
|
|
|
|
// ----------------------------------------------------------------------------
|
|
// Statements
|
|
|
|
|
|
func (P *parser) parseSimpleStmt() ast.Stmt {
|
|
if P.trace {
|
|
defer un(trace(P, "SimpleStmt"));
|
|
}
|
|
|
|
x := P.parseExpressionList();
|
|
|
|
switch P.tok {
|
|
case token.COLON:
|
|
// labeled statement
|
|
P.expect(token.COLON);
|
|
if len(x) == 1 {
|
|
if label, is_ident := x[0].(*ast.Ident); is_ident {
|
|
return &ast.LabeledStmt{label, P.parseStatement()};
|
|
}
|
|
}
|
|
P.error(x[0].Pos(), "illegal label declaration");
|
|
return &ast.BadStmt{x[0].Pos()};
|
|
|
|
case
|
|
token.DEFINE, token.ASSIGN, token.ADD_ASSIGN,
|
|
token.SUB_ASSIGN, token.MUL_ASSIGN, token.QUO_ASSIGN,
|
|
token.REM_ASSIGN, token.AND_ASSIGN, token.OR_ASSIGN,
|
|
token.XOR_ASSIGN, token.SHL_ASSIGN, token.SHR_ASSIGN:
|
|
// assignment statement
|
|
pos, tok := P.pos, P.tok;
|
|
P.next();
|
|
y := P.parseExpressionList();
|
|
if len(x) > 1 && len(y) > 1 && len(x) != len(y) {
|
|
P.error(x[0].Pos(), "arity of lhs doesn't match rhs");
|
|
}
|
|
return &ast.AssignStmt{x, pos, tok, y};
|
|
}
|
|
|
|
if len(x) > 1 {
|
|
P.error(x[0].Pos(), "only one expression allowed");
|
|
// continue with first expression
|
|
}
|
|
|
|
if P.tok == token.INC || P.tok == token.DEC {
|
|
// increment or decrement
|
|
s := &ast.IncDecStmt{x[0], P.tok};
|
|
P.next(); // consume "++" or "--"
|
|
return s;
|
|
}
|
|
|
|
// expression
|
|
return &ast.ExprStmt{x[0]};
|
|
}
|
|
|
|
|
|
func (P *parser) parseCallExpr() *ast.CallExpr {
|
|
x := P.parseExpression(1);
|
|
if call, is_call := x.(*ast.CallExpr); is_call {
|
|
return call;
|
|
}
|
|
P.error(x.Pos(), "expected function/method call");
|
|
return nil;
|
|
}
|
|
|
|
|
|
func (P *parser) parseGoStmt() ast.Stmt {
|
|
if P.trace {
|
|
defer un(trace(P, "GoStmt"));
|
|
}
|
|
|
|
pos := P.expect(token.GO);
|
|
call := P.parseCallExpr();
|
|
if call != nil {
|
|
return &ast.GoStmt{pos, call};
|
|
}
|
|
return &ast.BadStmt{pos};
|
|
}
|
|
|
|
|
|
func (P *parser) parseDeferStmt() ast.Stmt {
|
|
if P.trace {
|
|
defer un(trace(P, "DeferStmt"));
|
|
}
|
|
|
|
pos := P.expect(token.DEFER);
|
|
call := P.parseCallExpr();
|
|
if call != nil {
|
|
return &ast.DeferStmt{pos, call};
|
|
}
|
|
return &ast.BadStmt{pos};
|
|
}
|
|
|
|
|
|
func (P *parser) parseReturnStmt() *ast.ReturnStmt {
|
|
if P.trace {
|
|
defer un(trace(P, "ReturnStmt"));
|
|
}
|
|
|
|
loc := P.pos;
|
|
P.expect(token.RETURN);
|
|
var x []ast.Expr;
|
|
if P.tok != token.SEMICOLON && P.tok != token.RBRACE {
|
|
x = P.parseExpressionList();
|
|
}
|
|
|
|
return &ast.ReturnStmt{loc, x};
|
|
}
|
|
|
|
|
|
func (P *parser) parseBranchStmt(tok token.Token) *ast.BranchStmt {
|
|
if P.trace {
|
|
defer un(trace(P, "BranchStmt"));
|
|
}
|
|
|
|
s := &ast.BranchStmt{P.pos, tok, nil};
|
|
P.expect(tok);
|
|
if tok != token.FALLTHROUGH && P.tok == token.IDENT {
|
|
s.Label = P.parseIdent();
|
|
}
|
|
|
|
return s;
|
|
}
|
|
|
|
|
|
func (P *parser) isExpr(s ast.Stmt) bool {
|
|
if s == nil {
|
|
return true;
|
|
}
|
|
dummy, is_expr := s.(*ast.ExprStmt);
|
|
return is_expr;
|
|
}
|
|
|
|
|
|
func (P *parser) asExpr(s ast.Stmt) ast.Expr {
|
|
if s == nil {
|
|
return nil;
|
|
}
|
|
if es, is_expr := s.(*ast.ExprStmt); is_expr {
|
|
return es.X;
|
|
}
|
|
P.error(s.Pos(), "condition expected; found simple statement");
|
|
return &ast.BadExpr{s.Pos()};
|
|
}
|
|
|
|
|
|
func (P *parser) parseControlClause(isForStmt bool) (s1, s2, s3 ast.Stmt) {
|
|
if P.trace {
|
|
defer un(trace(P, "ControlClause"));
|
|
}
|
|
|
|
if P.tok != token.LBRACE {
|
|
prev_lev := P.expr_lev;
|
|
P.expr_lev = -1;
|
|
|
|
if P.tok != token.SEMICOLON {
|
|
s1 = P.parseSimpleStmt();
|
|
}
|
|
if P.tok == token.SEMICOLON {
|
|
P.next();
|
|
if P.tok != token.LBRACE && P.tok != token.SEMICOLON {
|
|
s2 = P.parseSimpleStmt();
|
|
}
|
|
if isForStmt {
|
|
// for statements have a 3rd section
|
|
P.expect(token.SEMICOLON);
|
|
if P.tok != token.LBRACE {
|
|
s3 = P.parseSimpleStmt();
|
|
}
|
|
}
|
|
} else {
|
|
s1, s2 = nil, s1;
|
|
}
|
|
|
|
P.expr_lev = prev_lev;
|
|
}
|
|
|
|
return s1, s2, s3;
|
|
}
|
|
|
|
|
|
func (P *parser) parseIfStmt() *ast.IfStmt {
|
|
if P.trace {
|
|
defer un(trace(P, "IfStmt"));
|
|
}
|
|
|
|
pos := P.expect(token.IF);
|
|
s1, s2, dummy := P.parseControlClause(false);
|
|
body := P.parseBlockStmt();
|
|
var else_ ast.Stmt;
|
|
if P.tok == token.ELSE {
|
|
P.next();
|
|
else_ = P.parseStatement();
|
|
}
|
|
|
|
return &ast.IfStmt{pos, s1, P.asExpr(s2), body, else_};
|
|
}
|
|
|
|
|
|
func (P *parser) parseCaseClause() *ast.CaseClause {
|
|
if P.trace {
|
|
defer un(trace(P, "CaseClause"));
|
|
}
|
|
|
|
// SwitchCase
|
|
loc := P.pos;
|
|
var x []ast.Expr;
|
|
if P.tok == token.CASE {
|
|
P.next();
|
|
x = P.parseExpressionList();
|
|
} else {
|
|
P.expect(token.DEFAULT);
|
|
}
|
|
|
|
colon := P.expect(token.COLON);
|
|
body := P.parseStatementList();
|
|
|
|
return &ast.CaseClause{loc, x, colon, body};
|
|
}
|
|
|
|
|
|
func (P *parser) parseTypeCaseClause() *ast.TypeCaseClause {
|
|
if P.trace {
|
|
defer un(trace(P, "CaseClause"));
|
|
}
|
|
|
|
// TypeSwitchCase
|
|
pos := P.pos;
|
|
var typ ast.Expr;
|
|
if P.tok == token.CASE {
|
|
P.next();
|
|
typ = P.parseType();
|
|
} else {
|
|
P.expect(token.DEFAULT);
|
|
}
|
|
|
|
colon := P.expect(token.COLON);
|
|
body := P.parseStatementList();
|
|
|
|
return &ast.TypeCaseClause{pos, typ, colon, body};
|
|
}
|
|
|
|
|
|
func (P *parser) parseSwitchStmt() ast.Stmt {
|
|
if P.trace {
|
|
defer un(trace(P, "SwitchStmt"));
|
|
}
|
|
|
|
pos := P.expect(token.SWITCH);
|
|
s1, s2, dummy := P.parseControlClause(false);
|
|
|
|
if P.isExpr(s2) {
|
|
// expression switch
|
|
lbrace := P.expect(token.LBRACE);
|
|
cases := vector.New(0);
|
|
for P.tok == token.CASE || P.tok == token.DEFAULT {
|
|
cases.Push(P.parseCaseClause());
|
|
}
|
|
rbrace := P.expect(token.RBRACE);
|
|
P.opt_semi = true;
|
|
body := &ast.BlockStmt{lbrace, asStmtList(cases), rbrace};
|
|
return &ast.SwitchStmt{pos, s1, P.asExpr(s2), body};
|
|
|
|
} else {
|
|
// type switch
|
|
// TODO do all the checks!
|
|
lbrace := P.expect(token.LBRACE);
|
|
cases := vector.New(0);
|
|
for P.tok == token.CASE || P.tok == token.DEFAULT {
|
|
cases.Push(P.parseTypeCaseClause());
|
|
}
|
|
rbrace := P.expect(token.RBRACE);
|
|
P.opt_semi = true;
|
|
body := &ast.BlockStmt{lbrace, asStmtList(cases), rbrace};
|
|
return &ast.TypeSwitchStmt{pos, s1, s2, body};
|
|
}
|
|
|
|
unreachable();
|
|
return nil;
|
|
}
|
|
|
|
|
|
func (P *parser) parseCommClause() *ast.CommClause {
|
|
if P.trace {
|
|
defer un(trace(P, "CommClause"));
|
|
}
|
|
|
|
// CommCase
|
|
loc := P.pos;
|
|
var tok token.Token;
|
|
var lhs, rhs ast.Expr;
|
|
if P.tok == token.CASE {
|
|
P.next();
|
|
if P.tok == token.ARROW {
|
|
// RecvExpr without assignment
|
|
rhs = P.parseExpression(1);
|
|
} else {
|
|
// SendExpr or RecvExpr
|
|
rhs = P.parseExpression(1);
|
|
if P.tok == token.ASSIGN || P.tok == token.DEFINE {
|
|
// RecvExpr with assignment
|
|
tok = P.tok;
|
|
P.next();
|
|
lhs = rhs;
|
|
if P.tok == token.ARROW {
|
|
rhs = P.parseExpression(1);
|
|
} else {
|
|
P.expect(token.ARROW); // use expect() error handling
|
|
}
|
|
}
|
|
// else SendExpr
|
|
}
|
|
} else {
|
|
P.expect(token.DEFAULT);
|
|
}
|
|
|
|
colon := P.expect(token.COLON);
|
|
body := P.parseStatementList();
|
|
|
|
return &ast.CommClause{loc, tok, lhs, rhs, colon, body};
|
|
}
|
|
|
|
|
|
func (P *parser) parseSelectStmt() *ast.SelectStmt {
|
|
if P.trace {
|
|
defer un(trace(P, "SelectStmt"));
|
|
}
|
|
|
|
pos := P.expect(token.SELECT);
|
|
lbrace := P.expect(token.LBRACE);
|
|
cases := vector.New(0);
|
|
for P.tok == token.CASE || P.tok == token.DEFAULT {
|
|
cases.Push(P.parseCommClause());
|
|
}
|
|
rbrace := P.expect(token.RBRACE);
|
|
P.opt_semi = true;
|
|
body := &ast.BlockStmt{lbrace, asStmtList(cases), rbrace};
|
|
|
|
return &ast.SelectStmt{pos, body};
|
|
}
|
|
|
|
|
|
func (P *parser) parseForStmt() ast.Stmt {
|
|
if P.trace {
|
|
defer un(trace(P, "ForStmt"));
|
|
}
|
|
|
|
pos := P.expect(token.FOR);
|
|
s1, s2, s3 := P.parseControlClause(true);
|
|
body := P.parseBlockStmt();
|
|
|
|
if as, is_as := s2.(*ast.AssignStmt); is_as {
|
|
// possibly a for statement with a range clause; check assignment operator
|
|
if as.Tok != token.ASSIGN && as.Tok != token.DEFINE {
|
|
P.error(as.TokPos, "'=' or ':=' expected");
|
|
return &ast.BadStmt{pos};
|
|
}
|
|
// check lhs
|
|
var key, value ast.Expr;
|
|
switch len(as.Lhs) {
|
|
case 2:
|
|
value = as.Lhs[1];
|
|
fallthrough;
|
|
case 1:
|
|
key = as.Lhs[0];
|
|
default:
|
|
P.error(as.Lhs[0].Pos(), "expected 1 or 2 expressions");
|
|
return &ast.BadStmt{pos};
|
|
}
|
|
// check rhs
|
|
if len(as.Rhs) != 1 {
|
|
P.error(as.Rhs[0].Pos(), "expected 1 expressions");
|
|
return &ast.BadStmt{pos};
|
|
}
|
|
if rhs, is_unary := as.Rhs[0].(*ast.UnaryExpr); is_unary && rhs.Op == token.RANGE {
|
|
// rhs is range expression; check lhs
|
|
return &ast.RangeStmt{pos, key, value, as.TokPos, as.Tok, rhs.X, body}
|
|
} else {
|
|
P.error(s2.Pos(), "range clause expected");
|
|
return &ast.BadStmt{pos};
|
|
}
|
|
} else {
|
|
// regular for statement
|
|
return &ast.ForStmt{pos, s1, P.asExpr(s2), s3, body};
|
|
}
|
|
|
|
unreachable();
|
|
return nil;
|
|
}
|
|
|
|
|
|
func (P *parser) parseStatement() ast.Stmt {
|
|
if P.trace {
|
|
defer un(trace(P, "Statement"));
|
|
}
|
|
|
|
switch P.tok {
|
|
case token.CONST, token.TYPE, token.VAR:
|
|
return &ast.DeclStmt{P.parseDeclaration()};
|
|
case
|
|
// tokens that may start a top-level expression
|
|
token.IDENT, token.INT, token.FLOAT, token.CHAR, token.STRING, token.FUNC, token.LPAREN, // operand
|
|
token.LBRACK, token.STRUCT, // composite type
|
|
token.MUL, token.AND, token.ARROW: // unary operators
|
|
return P.parseSimpleStmt();
|
|
case token.GO:
|
|
return P.parseGoStmt();
|
|
case token.DEFER:
|
|
return P.parseDeferStmt();
|
|
case token.RETURN:
|
|
return P.parseReturnStmt();
|
|
case token.BREAK, token.CONTINUE, token.GOTO, token.FALLTHROUGH:
|
|
return P.parseBranchStmt(P.tok);
|
|
case token.LBRACE:
|
|
return P.parseBlockStmt();
|
|
case token.IF:
|
|
return P.parseIfStmt();
|
|
case token.FOR:
|
|
return P.parseForStmt();
|
|
case token.SWITCH:
|
|
return P.parseSwitchStmt();
|
|
case token.SELECT:
|
|
return P.parseSelectStmt();
|
|
case token.SEMICOLON, token.RBRACE:
|
|
// don't consume the ";", it is the separator following the empty statement
|
|
return &ast.EmptyStmt{P.pos};
|
|
}
|
|
|
|
// no statement found
|
|
P.error(P.pos, "statement expected");
|
|
return &ast.BadStmt{P.pos};
|
|
}
|
|
|
|
|
|
// ----------------------------------------------------------------------------
|
|
// Declarations
|
|
|
|
func (P *parser) parseImportSpec(pos token.Position, doc ast.Comments) *ast.ImportDecl {
|
|
if P.trace {
|
|
defer un(trace(P, "ImportSpec"));
|
|
}
|
|
|
|
var ident *ast.Ident;
|
|
if P.tok == token.PERIOD {
|
|
P.error(P.pos, `"import ." not yet handled properly`);
|
|
P.next();
|
|
} else if P.tok == token.IDENT {
|
|
ident = P.parseIdent();
|
|
}
|
|
|
|
var path []*ast.StringLit;
|
|
if P.tok == token.STRING {
|
|
path = P.parseStringList(nil);
|
|
} else {
|
|
P.expect(token.STRING); // use expect() error handling
|
|
}
|
|
|
|
return &ast.ImportDecl{doc, pos, ident, path};
|
|
}
|
|
|
|
|
|
func (P *parser) parseConstSpec(pos token.Position, doc ast.Comments) *ast.ConstDecl {
|
|
if P.trace {
|
|
defer un(trace(P, "ConstSpec"));
|
|
}
|
|
|
|
names := P.parseIdentList(nil);
|
|
typ := P.tryType();
|
|
var values []ast.Expr;
|
|
if typ != nil || P.tok == token.ASSIGN {
|
|
P.expect(token.ASSIGN);
|
|
values = P.parseExpressionList();
|
|
}
|
|
|
|
return &ast.ConstDecl{doc, pos, names, typ, values};
|
|
}
|
|
|
|
|
|
func (P *parser) parseTypeSpec(pos token.Position, doc ast.Comments) *ast.TypeDecl {
|
|
if P.trace {
|
|
defer un(trace(P, "TypeSpec"));
|
|
}
|
|
|
|
ident := P.parseIdent();
|
|
typ := P.parseType();
|
|
|
|
return &ast.TypeDecl{doc, pos, ident, typ};
|
|
}
|
|
|
|
|
|
func (P *parser) parseVarSpec(pos token.Position, doc ast.Comments) *ast.VarDecl {
|
|
if P.trace {
|
|
defer un(trace(P, "VarSpec"));
|
|
}
|
|
|
|
names := P.parseIdentList(nil);
|
|
typ := P.tryType();
|
|
var values []ast.Expr;
|
|
if typ == nil || P.tok == token.ASSIGN {
|
|
P.expect(token.ASSIGN);
|
|
values = P.parseExpressionList();
|
|
}
|
|
|
|
return &ast.VarDecl{doc, pos, names, typ, values};
|
|
}
|
|
|
|
|
|
func (P *parser) parseSpec(pos token.Position, doc ast.Comments, keyword int) ast.Decl {
|
|
switch keyword {
|
|
case token.IMPORT: return P.parseImportSpec(pos, doc);
|
|
case token.CONST: return P.parseConstSpec(pos, doc);
|
|
case token.TYPE: return P.parseTypeSpec(pos, doc);
|
|
case token.VAR: return P.parseVarSpec(pos, doc);
|
|
}
|
|
|
|
unreachable();
|
|
return nil;
|
|
}
|
|
|
|
|
|
func (P *parser) parseDecl(keyword int) ast.Decl {
|
|
if P.trace {
|
|
defer un(trace(P, "Decl"));
|
|
}
|
|
|
|
doc := P.getDoc();
|
|
pos := P.expect(keyword);
|
|
if P.tok == token.LPAREN {
|
|
lparen := P.pos;
|
|
P.next();
|
|
list := vector.New(0);
|
|
for P.tok != token.RPAREN && P.tok != token.EOF {
|
|
list.Push(P.parseSpec(nopos, nil, keyword));
|
|
if P.tok == token.SEMICOLON {
|
|
P.next();
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
rparen := P.expect(token.RPAREN);
|
|
P.opt_semi = true;
|
|
|
|
// convert vector
|
|
decls := make([]ast.Decl, list.Len());
|
|
for i := 0; i < list.Len(); i++ {
|
|
decls[i] = list.At(i).(ast.Decl);
|
|
}
|
|
|
|
return &ast.DeclList{doc, pos, keyword, lparen, decls, rparen};
|
|
}
|
|
|
|
return P.parseSpec(pos, doc, keyword);
|
|
}
|
|
|
|
|
|
// Function and method declarations
|
|
//
|
|
// func ident (params)
|
|
// func ident (params) type
|
|
// func ident (params) (results)
|
|
// func (recv) ident (params)
|
|
// func (recv) ident (params) type
|
|
// func (recv) ident (params) (results)
|
|
|
|
func (P *parser) parseFunctionDecl() *ast.FuncDecl {
|
|
if P.trace {
|
|
defer un(trace(P, "FunctionDecl"));
|
|
}
|
|
|
|
doc := P.getDoc();
|
|
pos := P.expect(token.FUNC);
|
|
|
|
var recv *ast.Field;
|
|
if P.tok == token.LPAREN {
|
|
loc := P.pos;
|
|
tmp := P.parseParameters(true);
|
|
if len(tmp) == 1 {
|
|
recv = tmp[0];
|
|
} else {
|
|
P.error(loc, "must have exactly one receiver");
|
|
}
|
|
}
|
|
|
|
ident := P.parseIdent();
|
|
params, results := P.parseSignature();
|
|
|
|
var body *ast.BlockStmt;
|
|
if P.tok == token.LBRACE {
|
|
body = P.parseBlockStmt();
|
|
}
|
|
|
|
return &ast.FuncDecl{doc, recv, ident, &ast.FunctionType{pos, params, results}, body};
|
|
}
|
|
|
|
|
|
func (P *parser) parseDeclaration() ast.Decl {
|
|
if P.trace {
|
|
defer un(trace(P, "Declaration"));
|
|
}
|
|
|
|
switch P.tok {
|
|
case token.CONST, token.TYPE, token.VAR:
|
|
return P.parseDecl(P.tok);
|
|
case token.FUNC:
|
|
return P.parseFunctionDecl();
|
|
}
|
|
|
|
loc := P.pos;
|
|
P.error(loc, "declaration expected");
|
|
P.next(); // make progress
|
|
return &ast.BadDecl{loc};
|
|
}
|
|
|
|
|
|
// ----------------------------------------------------------------------------
|
|
// Packages
|
|
|
|
// The Mode constants control how much of the source text is parsed.
|
|
type Mode int;
|
|
const (
|
|
ParseEntirePackage Mode = iota;
|
|
ParseImportDeclsOnly;
|
|
ParsePackageClauseOnly;
|
|
)
|
|
|
|
|
|
func (P *parser) parsePackage(mode Mode) *ast.Package {
|
|
if P.trace {
|
|
defer un(trace(P, "Program"));
|
|
}
|
|
|
|
// package clause
|
|
comment := P.getDoc();
|
|
pos := P.expect(token.PACKAGE);
|
|
name := P.parseIdent();
|
|
if P.tok == token.SEMICOLON {
|
|
// common error
|
|
P.error(P.pos, "extra semicolon");
|
|
P.next();
|
|
}
|
|
|
|
|
|
var decls []ast.Decl;
|
|
if mode <= ParseImportDeclsOnly {
|
|
// import decls
|
|
list := vector.New(0);
|
|
for P.tok == token.IMPORT {
|
|
list.Push(P.parseDecl(token.IMPORT));
|
|
if P.tok == token.SEMICOLON {
|
|
P.next();
|
|
}
|
|
}
|
|
|
|
if mode <= ParseEntirePackage {
|
|
// rest of package body
|
|
for P.tok != token.EOF {
|
|
list.Push(P.parseDeclaration());
|
|
if P.tok == token.SEMICOLON {
|
|
P.next();
|
|
}
|
|
}
|
|
}
|
|
|
|
// convert declaration list
|
|
decls = make([]ast.Decl, list.Len());
|
|
for i := 0; i < list.Len(); i++ {
|
|
decls[i] = list.At(i).(ast.Decl);
|
|
}
|
|
}
|
|
|
|
// convert comments list
|
|
comments := make([]*ast.Comment, P.comments.Len());
|
|
for i := 0; i < P.comments.Len(); i++ {
|
|
c := P.comments.At(i);
|
|
if c != nil {
|
|
comments[i] = c.(*ast.Comment);
|
|
}
|
|
}
|
|
|
|
return &ast.Package{comment, pos, name, decls, comments};
|
|
}
|
|
|
|
|
|
// ----------------------------------------------------------------------------
|
|
// Parsing of entire programs.
|
|
|
|
// Parse invokes the Go parser. It calls the scanner's Scan method repeatedly
|
|
// to obtain the token sequence corresponding to the source code. The sequence
|
|
// is parsed according to Go syntax and the corresponding abstract syntax tree
|
|
// is constructed. The error handler err will be used to report syntax errors.
|
|
//
|
|
// If no syntax errors were encountered (i.e., if the error handler was never
|
|
// called), the result is a correct AST. If errors were encountered, the AST
|
|
// may only be constructed partially, with ast.BadX nodes representing the
|
|
// fragments of source code that contained syntax errors.
|
|
//
|
|
// The amount of source text parsed can be controlled with the mode parameter.
|
|
// The flags parameter controls optional parser functionality such as tracing.
|
|
//
|
|
func Parse(scanner Scanner, err ErrorHandler, mode Mode, flags uint) *ast.Package {
|
|
// initialize parser state
|
|
var p parser;
|
|
p.scanner = scanner;
|
|
p.err = err;
|
|
p.trace = flags & Trace != 0;
|
|
p.comments.Init(0);
|
|
p.next();
|
|
|
|
// parse program
|
|
return p.parsePackage(mode);
|
|
}
|