/*

* This file includes functions to transform a concrete syntax tree (CST) to

* an abstract syntax tree (AST). The main function is PyAST_FromNode().

*

*/

#include "Python.h"

#include "Python-ast.h"

#include "grammar.h"

#include "node.h"

#include "pyarena.h"

#include "ast.h"

#include "token.h"

#include "parsetok.h"

#include "graminit.h"

#include <assert.h>

/* Data structure used internally */

struct compiling {

char *c_encoding; /* source encoding */

PyArena *c_arena; /* arena for allocating memeory */

};

static asdl_seq *seq_for_testlist(struct compiling *, const node *);

static expr_ty ast_for_expr(struct compiling *, const node *);

static stmt_ty ast_for_stmt(struct compiling *, const node *);

static asdl_seq *ast_for_suite(struct compiling *, const node *);

static asdl_seq *ast_for_exprlist(struct compiling *, const node *, expr_context_ty);

static expr_ty ast_for_testlist(struct compiling *, const node *);

static expr_ty ast_for_testlist_gexp(struct compiling *, const node *);

/* Note different signature for ast_for_call */

static expr_ty ast_for_call(struct compiling *, const node *, expr_ty);

static PyObject *parsenumber(const char *);

static PyObject *parsestr(const char *s, const char *encoding);

static PyObject *parsestrplus(struct compiling *, const node *n);

#ifndef LINENO

#define LINENO(n) ((n)->n_lineno)

#endif

static identifier

new_identifier(const char* n, PyArena *arena) {

PyObject* id = PyString_InternFromString(n);

PyArena_AddPyObject(arena, id);

return id;

}

#define NEW_IDENTIFIER(n) new_identifier(STR(n), c->c_arena)

/* This routine provides an invalid object for the syntax error.

The outermost routine must unpack this error and create the

proper object. We do this so that we don't have to pass

the filename to everything function.

XXX Maybe we should just pass the filename...

*/

static int

ast_error(const node *n, const char *errstr)

{

PyObject *u = Py_BuildValue("zi", errstr, LINENO(n));

if (!u)

return 0;

PyErr_SetObject(PyExc_SyntaxError, u);

Py_DECREF(u);

return 0;

}

static void

ast_error_finish(const char *filename)

{

PyObject *type, *value, *tback, *errstr, *loc, *tmp;

long lineno;

assert(PyErr_Occurred());

if (!PyErr_ExceptionMatches(PyExc_SyntaxError))

return;

PyErr_Fetch(&type, &value, &tback);

errstr = PyTuple_GetItem(value, 0);

if (!errstr)

return;

Py_INCREF(errstr);

lineno = PyInt_AsLong(PyTuple_GetItem(value, 1));

if (lineno == -1) {

Py_DECREF(errstr);

return;

}

Py_DECREF(value);

loc = PyErr_ProgramText(filename, lineno);

if (!loc) {

Py_INCREF(Py_None);

loc = Py_None;

}

tmp = Py_BuildValue("(zlOO)", filename, lineno, Py_None, loc);

Py_DECREF(loc);

if (!tmp) {

Py_DECREF(errstr);

return;

}

value = PyTuple_Pack(2, errstr, tmp);

Py_DECREF(errstr);

Py_DECREF(tmp);

if (!value)

return;

PyErr_Restore(type, value, tback);

}

/* num_stmts() returns number of contained statements.

Use this routine to determine how big a sequence is needed for

the statements in a parse tree. Its raison d'etre is this bit of

grammar:

stmt: simple_stmt | compound_stmt

simple_stmt: small_stmt (';' small_stmt)* [';'] NEWLINE

A simple_stmt can contain multiple small_stmt elements joined

by semicolons. If the arg is a simple_stmt, the number of

small_stmt elements is returned.

*/

static int

num_stmts(const node *n)

{

int i, l;

node *ch;

switch (TYPE(n)) {

case single_input:

if (TYPE(CHILD(n, 0)) == NEWLINE)

return 0;

else

return num_stmts(CHILD(n, 0));

case file_input:

l = 0;

for (i = 0; i < NCH(n); i++) {

ch = CHILD(n, i);

if (TYPE(ch) == stmt)

l += num_stmts(ch);

}

return l;

case stmt:

return num_stmts(CHILD(n, 0));

case compound_stmt:

return 1;

case simple_stmt:

return NCH(n) / 2; /* Divide by 2 to remove count of semi-colons */

case suite:

if (NCH(n) == 1)

return num_stmts(CHILD(n, 0));

else {

l = 0;

for (i = 2; i < (NCH(n) - 1); i++)

l += num_stmts(CHILD(n, i));

return l;

}

default: {

char buf[128];

sprintf(buf, "Non-statement found: %d %d\n",

TYPE(n), NCH(n));

Py_FatalError(buf);

}

}

assert(0);

return 0;

}

/* Transform the CST rooted at node * to the appropriate AST

*/

mod_ty

PyAST_FromNode(const node *n, PyCompilerFlags *flags, const char *filename,

PyArena *arena)

{

int i, j, k, num;

asdl_seq *stmts = NULL;

stmt_ty s;

node *ch;

struct compiling c;

if (flags && flags->cf_flags & PyCF_SOURCE_IS_UTF8) {

c.c_encoding = "utf-8";

if (TYPE(n) == encoding_decl) {

ast_error(n, "encoding declaration in Unicode string");

goto error;

}

} else if (TYPE(n) == encoding_decl) {

c.c_encoding = STR(n);

n = CHILD(n, 0);

} else {

c.c_encoding = NULL;

}

c.c_arena = arena;

k = 0;

switch (TYPE(n)) {

case file_input:

stmts = asdl_seq_new(num_stmts(n), arena);

if (!stmts)

return NULL;

for (i = 0; i < NCH(n) - 1; i++) {

ch = CHILD(n, i);

if (TYPE(ch) == NEWLINE)

continue;

REQ(ch, stmt);

num = num_stmts(ch);

if (num == 1) {

s = ast_for_stmt(&c, ch);

if (!s)

goto error;

asdl_seq_SET(stmts, k++, s);

}

else {

ch = CHILD(ch, 0);

REQ(ch, simple_stmt);

for (j = 0; j < num; j++) {

s = ast_for_stmt(&c, CHILD(ch, j * 2));

if (!s)

goto error;

asdl_seq_SET(stmts, k++, s);

}

}

}

return Module(stmts, arena);

case eval_input: {

expr_ty testlist_ast;

/* XXX Why not gen_for here? */

testlist_ast = ast_for_testlist(&c, CHILD(n, 0));

if (!testlist_ast)

goto error;

return Expression(testlist_ast, arena);

}

case single_input:

if (TYPE(CHILD(n, 0)) == NEWLINE) {

stmts = asdl_seq_new(1, arena);

if (!stmts)

goto error;

asdl_seq_SET(stmts, 0, Pass(n->n_lineno, n->n_col_offset,

arena));

return Interactive(stmts, arena);

}

else {

n = CHILD(n, 0);

num = num_stmts(n);

stmts = asdl_seq_new(num, arena);

if (!stmts)

goto error;

if (num == 1) {

s = ast_for_stmt(&c, n);

if (!s)

goto error;

asdl_seq_SET(stmts, 0, s);

}

else {

/* Only a simple_stmt can contain multiple statements. */

REQ(n, simple_stmt);

for (i = 0; i < NCH(n); i += 2) {

if (TYPE(CHILD(n, i)) == NEWLINE)

break;

s = ast_for_stmt(&c, CHILD(n, i));

if (!s)

goto error;

asdl_seq_SET(stmts, i / 2, s);

}

}

return Interactive(stmts, arena);

}

default:

goto error;

}

error:

ast_error_finish(filename);

return NULL;

}

/* Return the AST repr. of the operator represented as syntax (|, ^, etc.)

*/

static operator_ty

get_operator(const node *n)

{

switch (TYPE(n)) {

case VBAR:

return BitOr;

case CIRCUMFLEX:

return BitXor;

case AMPER:

return BitAnd;

case LEFTSHIFT:

return LShift;

case RIGHTSHIFT:

return RShift;

case PLUS:

return Add;

case MINUS:

return Sub;

case STAR:

return Mult;

case SLASH:

return Div;

case DOUBLESLASH:

return FloorDiv;

case PERCENT:

return Mod;

default:

return (operator_ty)0;

}

}

/* Set the context ctx for expr_ty e, recursively traversing e.

Only sets context for expr kinds that "can appear in assignment context"

(according to ../Parser/Python.asdl). For other expr kinds, it sets

an appropriate syntax error and returns false.

*/

static int

set_context(expr_ty e, expr_context_ty ctx, const node *n)

{

asdl_seq *s = NULL;

/* If a particular expression type can't be used for assign / delete,

set expr_name to its name and an error message will be generated.

*/

const char* expr_name = NULL;

/* The ast defines augmented store and load contexts, but the

implementation here doesn't actually use them. The code may be

a little more complex than necessary as a result. It also means

that expressions in an augmented assignment have a Store context.

Consider restructuring so that augmented assignment uses

set_context(), too.

*/

assert(ctx != AugStore && ctx != AugLoad);

switch (e->kind) {

case Attribute_kind:

if (ctx == Store &&

!strcmp(PyString_AS_STRING(e->v.Attribute.attr), "None")) {

return ast_error(n, "assignment to None");

}

e->v.Attribute.ctx = ctx;

break;

case Subscript_kind:

e->v.Subscript.ctx = ctx;

break;

case Name_kind:

if (ctx == Store &&

!strcmp(PyString_AS_STRING(e->v.Name.id), "None")) {

return ast_error(n, "assignment to None");

}

e->v.Name.ctx = ctx;

break;

case List_kind:

e->v.List.ctx = ctx;

s = e->v.List.elts;

break;

case Tuple_kind:

if (asdl_seq_LEN(e->v.Tuple.elts) == 0)

return ast_error(n, "can't assign to ()");

e->v.Tuple.ctx = ctx;

s = e->v.Tuple.elts;

break;

case Lambda_kind:

expr_name = "lambda";

break;

case Call_kind:

expr_name = "function call";

break;

case BoolOp_kind:

case BinOp_kind:

case UnaryOp_kind:

expr_name = "operator";

break;

case GeneratorExp_kind:

expr_name = "generator expression";

break;

case Yield_kind:

expr_name = "yield expression";

break;

case ListComp_kind:

expr_name = "list comprehension";

break;

case Dict_kind:

case Set_kind:

case Num_kind:

case Str_kind:

expr_name = "literal";

break;

case Ellipsis_kind:

expr_name = "Ellipsis";

break;

case Compare_kind:

expr_name = "comparison";

break;

case IfExp_kind:

expr_name = "conditional expression";

break;

default:

PyErr_Format(PyExc_SystemError,

"unexpected expression in assignment %d (line %d)",

e->kind, e->lineno);

return 0;

}

/* Check for error string set by switch */

if (expr_name) {

char buf[300];

PyOS_snprintf(buf, sizeof(buf),

"can't %s %s",

ctx == Store ? "assign to" : "delete",

expr_name);

return ast_error(n, buf);

}

/* If the LHS is a list or tuple, we need to set the assignment

context for all the contained elements.

*/

if (s) {

int i;

for (i = 0; i < asdl_seq_LEN(s); i++) {

if (!set_context((expr_ty)asdl_seq_GET(s, i), ctx, n))

return 0;

}

}

return 1;

}

static operator_ty

ast_for_augassign(const node *n)

{

REQ(n, augassign);

n = CHILD(n, 0);

switch (STR(n)[0]) {

case '+':

return Add;

case '-':

return Sub;

case '/':

if (STR(n)[1] == '/')

return FloorDiv;

else

return Div;

case '%':

return Mod;

case '<':

return LShift;

case '>':

return RShift;

case '&':

return BitAnd;

case '^':

return BitXor;

case '|':

return BitOr;

case '*':

if (STR(n)[1] == '*')

return Pow;

else

return Mult;

default:

PyErr_Format(PyExc_SystemError, "invalid augassign: %s", STR(n));

return (operator_ty)0;

}

}

static cmpop_ty

ast_for_comp_op(const node *n)

{

/* comp_op: '<'|'>'|'=='|'>='|'<='|'!='|'in'|'not' 'in'|'is'

|'is' 'not'

*/

REQ(n, comp_op);

if (NCH(n) == 1) {

n = CHILD(n, 0);

switch (TYPE(n)) {

case LESS:

return Lt;

case GREATER:

return Gt;

case EQEQUAL: /* == */

return Eq;

case LESSEQUAL:

return LtE;

case GREATEREQUAL:

return GtE;

case NOTEQUAL:

return NotEq;

case NAME:

if (strcmp(STR(n), "in") == 0)

return In;

if (strcmp(STR(n), "is") == 0)

return Is;

default:

PyErr_Format(PyExc_SystemError, "invalid comp_op: %s",

STR(n));

return (cmpop_ty)0;

}

}

else if (NCH(n) == 2) {

/* handle "not in" and "is not" */

switch (TYPE(CHILD(n, 0))) {

case NAME:

if (strcmp(STR(CHILD(n, 1)), "in") == 0)

return NotIn;

if (strcmp(STR(CHILD(n, 0)), "is") == 0)

return IsNot;

default:

PyErr_Format(PyExc_SystemError, "invalid comp_op: %s %s",

STR(CHILD(n, 0)), STR(CHILD(n, 1)));

return (cmpop_ty)0;

}

}

PyErr_Format(PyExc_SystemError, "invalid comp_op: has %d children",

NCH(n));

return (cmpop_ty)0;

}

static asdl_seq *

seq_for_testlist(struct compiling *c, const node *n)

{

/* testlist: test (',' test)* [','] */

asdl_seq *seq;

expr_ty expression;

int i;

assert(TYPE(n) == testlist

|| TYPE(n) == listmaker

|| TYPE(n) == testlist_gexp

|| TYPE(n) == testlist_safe

|| TYPE(n) == testlist1

);

seq = asdl_seq_new((NCH(n) + 1) / 2, c->c_arena);

if (!seq)

return NULL;

for (i = 0; i < NCH(n); i += 2) {

assert(TYPE(CHILD(n, i)) == test || TYPE(CHILD(n, i)) == old_test);

expression = ast_for_expr(c, CHILD(n, i));

if (!expression)

return NULL;

assert(i / 2 < seq->size);

asdl_seq_SET(seq, i / 2, expression);

}

return seq;

}

static arg_ty

compiler_simple_arg(struct compiling *c, const node *n)

{

identifier name;

expr_ty annotation = NULL;

node *ch;

assert(TYPE(n) == tname || TYPE(n) == vname);

ch = CHILD(n, 0);

if (!strcmp(STR(ch), "None")) {

ast_error(ch, "assignment to None");

return NULL;

}

name = NEW_IDENTIFIER(ch);

if (!name)

return NULL;

if (NCH(n) == 3 && TYPE(CHILD(n, 1)) == COLON) {

annotation = ast_for_expr(c, CHILD(n, 2));

if (!annotation)

return NULL;

}

return SimpleArg(name, annotation, c->c_arena);

}

static arg_ty

compiler_complex_args(struct compiling *c, const node *n)

{

int i, len = (NCH(n) + 1) / 2;

arg_ty arg;

asdl_seq *args = asdl_seq_new(len, c->c_arena);

if (!args)

return NULL;

assert(TYPE(n) == tfplist || TYPE(n) == vfplist);

for (i = 0; i < len; i++) {

const node *child = CHILD(n, 2*i);

/* def foo(((x), y)): -- x is not nested complex, special case. */

while (NCH(child) == 3 && NCH(CHILD(child, 1)) == 1)

child = CHILD(CHILD(child, 1), 0);

/* child either holds a tname or '(', a tfplist, ')' */

switch (TYPE(CHILD(child, 0))) {

case tname:

case vname:

arg = compiler_simple_arg(c, CHILD(child, 0));

break;

case LPAR:

arg = compiler_complex_args(c, CHILD(child, 1));

break;

default:

PyErr_Format(PyExc_SystemError,

"unexpected node in args: %d @ %d",

TYPE(CHILD(child, 0)), i);

arg = NULL;

}

if (!arg)

return NULL;

asdl_seq_SET(args, i, arg);

}

return NestedArgs(args, c->c_arena);

}

/* returns -1 if failed to handle keyword only arguments

returns new position to keep processing if successful

(',' tname ['=' test])*

^^^

start pointing here

*/

static int

handle_keywordonly_args(struct compiling *c, const node *n, int start,

asdl_seq *kwonlyargs, asdl_seq *kwdefaults)

{

node *ch;

expr_ty expression, annotation;

arg_ty arg;

int i = start;

int j = 0; /* index for kwdefaults and kwonlyargs */

assert(kwonlyargs != NULL);

assert(kwdefaults != NULL);

while (i < NCH(n)) {

ch = CHILD(n, i);

switch (TYPE(ch)) {

case vname:

case tname:

if (i + 1 < NCH(n) && TYPE(CHILD(n, i + 1)) == EQUAL) {

expression = ast_for_expr(c, CHILD(n, i + 2));

if (!expression) {

ast_error(ch, "assignment to None");

goto error;

}

asdl_seq_SET(kwdefaults, j, expression);

i += 2; /* '=' and test */

}

else { /* setting NULL if no default value exists */

asdl_seq_SET(kwdefaults, j, NULL);

}

if (NCH(ch) == 3) {

/* ch is NAME ':' test */

annotation = ast_for_expr(c, CHILD(ch, 2));

if (!annotation) {

ast_error(ch, "expected expression");

goto error;

}

}

else {

annotation = NULL;

}

ch = CHILD(ch, 0);

if (!strcmp(STR(ch), "None")) {

ast_error(ch, "assignment to None");

goto error;

}

arg = SimpleArg(NEW_IDENTIFIER(ch), annotation, c->c_arena);

if (!arg) {

ast_error(ch, "expecting name");

goto error;

}

asdl_seq_SET(kwonlyargs, j++, arg);

i += 2; /* the name and the comma */

break;

case DOUBLESTAR:

return i;

default:

ast_error(ch, "unexpected node");

goto error;

}

}

return i;

error:

return -1;

}

/* Create AST for argument list. */

static arguments_ty

ast_for_arguments(struct compiling *c, const node *n)

{

/* This function handles both typedargslist (function definition)

and varargslist (lambda definition).

parameters: '(' [typedargslist] ')'

typedargslist: ((tfpdef ['=' test] ',')*

('*' [tname] (',' tname ['=' test])* [',' '**' tname]

| '**' tname)

| tfpdef ['=' test] (',' tfpdef ['=' test])* [','])

varargslist: ((vfpdef ['=' test] ',')*

('*' [vname] (',' vname ['=' test])* [',' '**' vname]

| '**' vname)

| vfpdef ['=' test] (',' vfpdef ['=' test])* [','])

*/

int i, j, k, nposargs = 0, nkwonlyargs = 0;

int nposdefaults = 0, found_default = 0;

asdl_seq *posargs, *posdefaults, *kwonlyargs, *kwdefaults;

identifier vararg = NULL, kwarg = NULL;

arg_ty arg;

expr_ty varargannotation = NULL, kwargannotation = NULL;

node *ch;

if (TYPE(n) == parameters) {

if (NCH(n) == 2) /* () as argument list */

return arguments(NULL, NULL, NULL, NULL, NULL, NULL, NULL,

NULL, c->c_arena);

n = CHILD(n, 1);

}

assert(TYPE(n) == typedargslist || TYPE(n) == varargslist);

/* first count the number of positional args & defaults */

for (i = 0; i < NCH(n); i++) {

ch = CHILD(n, i);

if (TYPE(ch) == STAR) {

if (TYPE(CHILD(n, i+1)) == tname

|| TYPE(CHILD(n, i+1)) == vname) {

/* skip NAME of vararg */

/* so that following can count only keyword only args */

i += 2;

}

else {

i++;

}

break;

}

if (TYPE(ch) == vfpdef || TYPE(ch) == tfpdef) nposargs++;

if (TYPE(ch) == EQUAL) nposdefaults++;

}

/* count the number of keyword only args &

defaults for keyword only args */

for ( ; i < NCH(n); ++i) {

ch = CHILD(n, i);

if (TYPE(ch) == DOUBLESTAR) break;

if (TYPE(ch) == tname || TYPE(ch) == vname) nkwonlyargs++;

}

posargs = (nposargs ? asdl_seq_new(nposargs, c->c_arena) : NULL);

if (!posargs && nposargs)

goto error;

kwonlyargs = (nkwonlyargs ?

asdl_seq_new(nkwonlyargs, c->c_arena) : NULL);

if (!kwonlyargs && nkwonlyargs)

goto error;

posdefaults = (nposdefaults ?

asdl_seq_new(nposdefaults, c->c_arena) : NULL);

if (!posdefaults && nposdefaults)

goto error;

/* The length of kwonlyargs and kwdefaults are same

since we set NULL as default for keyword only argument w/o default

- we have sequence data structure, but no dictionary */

kwdefaults = (nkwonlyargs ?

asdl_seq_new(nkwonlyargs, c->c_arena) : NULL);

if (!kwdefaults && nkwonlyargs)

goto error;

if (nposargs + nkwonlyargs > 255) {

ast_error(n, "more than 255 arguments");

return NULL;

}

/* tname: NAME [':' test]

tfpdef: tname | '(' tfplist ')'

tfplist: tfpdef (',' tfpdef)* [',']

vname: NAME

vfpdef: NAME | '(' vfplist ')'

vfplist: vfpdef (',' vfpdef)* [',']

*/

i = 0;

j = 0; /* index for defaults */

k = 0; /* index for args */

while (i < NCH(n)) {

ch = CHILD(n, i);

switch (TYPE(ch)) {

case tfpdef:

case vfpdef:

/* XXX Need to worry about checking if TYPE(CHILD(n, i+1)) is

anything other than EQUAL or a comma? */

/* XXX Should NCH(n) check be made a separate check? */

if (i + 1 < NCH(n) && TYPE(CHILD(n, i + 1)) == EQUAL) {

expr_ty expression = ast_for_expr(c, CHILD(n, i + 2));

if (!expression)

goto error;

assert(posdefaults != NULL);

asdl_seq_SET(posdefaults, j++, expression);

i += 2;

found_default = 1;

}

else if (found_default) {

ast_error(n,

"non-default argument follows default argument");

goto error;

}

/* def foo((x)): is not complex, special case. */

while (NCH(ch) == 3 && NCH(CHILD(ch, 1)) == 1)

ch = CHILD(CHILD(ch, 1), 0);

if (NCH(ch) != 1)

arg = compiler_complex_args(c, CHILD(ch, 1));

else

arg = compiler_simple_arg(c, CHILD(ch, 0));

if (!arg)

goto error;

asdl_seq_SET(posargs, k++, arg);

i += 2; /* the name and the comma */

break;

case STAR:

if (i+1 >= NCH(n)) {

ast_error(CHILD(n, i), "no name for vararg");

goto error;

}

ch = CHILD(n, i+1); /* tname or COMMA */

if (TYPE(ch) == COMMA) {

int res = 0;

i += 2; /* now follows keyword only arguments */

res = handle_keywordonly_args(c, n, i,

kwonlyargs, kwdefaults);

if (res == -1) goto error;

i = res; /* res has new position to process */

}

else if (!strcmp(STR(CHILD(ch, 0)), "None")) {

ast_error(CHILD(ch, 0), "assignment to None");

goto error;

}

else {

vararg = NEW_IDENTIFIER(CHILD(ch, 0));

if (NCH(ch) > 1) {

/* there is an annotation on the vararg */

varargannotation = ast_for_expr(c, CHILD(ch, 2));

}

i += 3;

if (i < NCH(n) && (TYPE(CHILD(n, i)) == tname

|| TYPE(CHILD(n, i)) == vname)) {

int res = 0;

res = handle_keywordonly_args(c, n, i,

kwonlyargs, kwdefaults);

if (res == -1) goto error;

i = res; /* res has new position to process */

}

}

break;

case DOUBLESTAR:

ch = CHILD(n, i+1); /* tname */

assert(TYPE(ch) == tname || TYPE(ch) == vname);

if (!strcmp(STR(CHILD(ch, 0)), "None")) {

ast_error(CHILD(ch, 0), "assignment to None");

goto error;

}

kwarg = NEW_IDENTIFIER(CHILD(ch, 0));

if (NCH(ch) > 1) {

/* there is an annotation on the kwarg */

kwargannotation = ast_for_expr(c, CHILD(ch, 2));

}

i += 3;

break;

default:

PyErr_Format(PyExc_SystemError,

"unexpected node in varargslist: %d @ %d",

TYPE(ch), i);

goto error;

}

}

return arguments(posargs, vararg, varargannotation, kwonlyargs, kwarg,

kwargannotation, posdefaults, kwdefaults, c->c_arena);

error:

Py_XDECREF(vararg);

Py_XDECREF(kwarg);

return NULL;

}

static expr_ty

ast_for_dotted_name(struct compiling *c, const node *n)

{

expr_ty e;

identifier id;

int lineno, col_offset;

int i;

REQ(n, dotted_name);

lineno = LINENO(n);

col_offset = n->n_col_offset;

id = NEW_IDENTIFIER(CHILD(n, 0));

if (!id)

return NULL;

e = Name(id, Load, lineno, col_offset, c->c_arena);

if (!e)

return NULL;

for (i = 2; i < NCH(n); i+=2) {

id = NEW_IDENTIFIER(CHILD(n, i));

if (!id)

return NULL;

e = Attribute(e, id, Load, lineno, col_offset, c->c_arena);

if (!e)

return NULL;

}

return e;

}

static expr_ty

ast_for_decorator(struct compiling *c, const node *n)

{

/* decorator: '@' dotted_name [ '(' [arglist] ')' ] NEWLINE */

expr_ty d = NULL;

expr_ty name_expr;

REQ(n, decorator);

REQ(CHILD(n, 0), AT);

REQ(RCHILD(n, -1), NEWLINE);

name_expr = ast_for_dotted_name(c, CHILD(n, 1));

if (!name_expr)

return NULL;

if (NCH(n) == 3) { /* No arguments */

d = name_expr;

name_expr = NULL;

}

else if (NCH(n) == 5) { /* Call with no arguments */

d = Call(name_expr, NULL, NULL, NULL, NULL, LINENO(n),

n->n_col_offset, c->c_arena);

if (!d)

return NULL;

name_expr = NULL;

}

else {

d = ast_for_call(c, CHILD(n, 3), name_expr);

if (!d)

return NULL;

name_expr = NULL;

}

return d;

}

static asdl_seq*

ast_for_decorators(struct compiling *c, const node *n)

{

asdl_seq* decorator_seq;

expr_ty d;

int i;

REQ(n, decorators);

decorator_seq = asdl_seq_new(NCH(n), c->c_arena);

if (!decorator_seq)

return NULL;

for (i = 0; i < NCH(n); i++) {

d = ast_for_decorator(c, CHILD(n, i));

if (!d)

return NULL;

asdl_seq_SET(decorator_seq, i, d);

}

return decorator_seq;

}

static stmt_ty

ast_for_funcdef(struct compiling *c, const node *n)

{

/* funcdef: 'def' [decorators] NAME parameters ['->' test] ':' suite */

identifier name;

arguments_ty args;

asdl_seq *body;

asdl_seq *decorator_seq = NULL;

expr_ty returns = NULL;

int name_i;

REQ(n, funcdef);

if (NCH(n) == 6) { /* decorators are present */

decorator_seq = ast_for_decorators(c, CHILD(n, 0));

if (!decorator_seq)

return NULL;

name_i = 2;

}

else {

name_i = 1;

}

name = NEW_IDENTIFIER(CHILD(n, name_i));

if (!name)

return NULL;

else if (!strcmp(STR(CHILD(n, name_i)), "None")) {