FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
python/Modules/parsermodule.c at master · anekix/python · GitHub
anekix
/
python
Public
forked from
glix/python
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
python
/
Modules
/
parsermodule.c
Copy path
More file actions
More file actions
Latest commit
History
History
History
3405 lines (2977 loc) · 97.3 KB
Breadcrumbs
python
/
Modules
/
parsermodule.c
Copy path
File metadata and controls
3405 lines (2977 loc) · 97.3 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* parsermodule.c
*
* Copyright 1995-1996 by Fred L. Drake, Jr. and Virginia Polytechnic
* Institute and State University, Blacksburg, Virginia, USA.
* Portions copyright 1991-1995 by Stichting Mathematisch Centrum,
* Amsterdam, The Netherlands. Copying is permitted under the terms
* associated with the main Python distribution, with the additional
* restriction that this additional notice be included and maintained
* on all distributed copies.
*
* This module serves to replace the original parser module written
* by Guido. The functionality is not matched precisely, but the
* original may be implemented on top of this. This is desirable
* since the source of the text to be parsed is now divorced from
* this interface.
*
* Unlike the prior interface, the ability to give a parse tree
* produced by Python code as a tuple to the compiler is enabled by
* this module. See the documentation for more details.
*
* I've added some annotations that help with the lint code-checking
* program, but they're not complete by a long shot. The real errors
* that lint detects are gone, but there are still warnings with
* Py_[X]DECREF() and Py_[X]INCREF() macros. The lint annotations
* look like "NOTE(...)".
*/
#include
"Python.h"
/* general Python API */
#include
"Python-ast.h"
/* mod_ty */
#include
"graminit.h"
/* symbols defined in the grammar */
#include
"node.h"
/* internal parser structure */
#include
"errcode.h"
/* error codes for PyNode_*() */
#include
"token.h"
/* token definitions */
#include
"grammar.h"
#include
"parsetok.h"
/* ISTERMINAL() / ISNONTERMINAL() */
#include
"compile.h"
#undef
Yield
#include
"ast.h"
#include
"pyarena.h"
extern
grammar
_PyParser_Grammar
;
/* From graminit.c */
#ifdef
lint
#include
<note.h>
#else
#define
NOTE
(
x
)
#endif
/* String constants used to initialize module attributes.
*
*/
static
char
parser_copyright_string
[]
=
"Copyright 1995-1996 by Virginia Polytechnic Institute & State\n\
University, Blacksburg, Virginia, USA, and Fred L. Drake, Jr., Reston,\n\
Virginia, USA. Portions copyright 1991-1995 by Stichting Mathematisch\n\
Centrum, Amsterdam, The Netherlands."
;
PyDoc_STRVAR
(
parser_doc_string
,
"This is an interface to Python's internal parser."
);
static
char
parser_version_string
[]
=
"0.5"
;
typedef
PyObject
*
(
*
SeqMaker
) (
Py_ssize_t
length
);
typedef
int
(
*
SeqInserter
) (
PyObject
*
sequence
,
Py_ssize_t
index
,
PyObject
*
element
);
/* The function below is copyrighted by Stichting Mathematisch Centrum. The
* original copyright statement is included below, and continues to apply
* in full to the function immediately following. All other material is
* original, copyrighted by Fred L. Drake, Jr. and Virginia Polytechnic
* Institute and State University. Changes were made to comply with the
* new naming conventions. Added arguments to provide support for creating
* lists as well as tuples, and optionally including the line numbers.
*/
static
PyObject
*
node2tuple
(
node
*
n
,
/* node to convert */
SeqMaker
mkseq
,
/* create sequence */
SeqInserter
addelem
,
/* func. to add elem. in seq. */
int
lineno
,
/* include line numbers? */
int
col_offset
)
/* include column offsets? */
{
if
(
n
==
NULL
) {
Py_INCREF
(
Py_None
);
return
(
Py_None
);
}
if
(
ISNONTERMINAL
(
TYPE
(
n
))) {
int
i
;
PyObject
*
v
;
PyObject
*
w
;
v
=
mkseq
(
1
+
NCH
(
n
)
+
(
TYPE
(
n
)
==
encoding_decl
));
if
(
v
==
NULL
)
return
(
v
);
w
=
PyInt_FromLong
(
TYPE
(
n
));
if
(
w
==
NULL
) {
Py_DECREF
(
v
);
return
((
PyObject
*
)
NULL
);
}
(
void
)
addelem
(
v
,
0
,
w
);
for
(
i
=
0
;
i
<
NCH
(
n
);
i
++
) {
w
=
node2tuple
(
CHILD
(
n
,
i
),
mkseq
,
addelem
,
lineno
,
col_offset
);
if
(
w
==
NULL
) {
Py_DECREF
(
v
);
return
((
PyObject
*
)
NULL
);
}
(
void
)
addelem
(
v
,
i
+
1
,
w
);
}
if
(
TYPE
(
n
)
==
encoding_decl
)
(
void
)
addelem
(
v
,
i
+
1
,
PyString_FromString
(
STR
(
n
)));
return
(
v
);
}
else
if
(
ISTERMINAL
(
TYPE
(
n
))) {
PyObject
*
result
=
mkseq
(
2
+
lineno
+
col_offset
);
if
(
result
!=
NULL
) {
(
void
)
addelem
(
result
,
0
,
PyInt_FromLong
(
TYPE
(
n
)));
(
void
)
addelem
(
result
,
1
,
PyString_FromString
(
STR
(
n
)));
if
(
lineno
==
1
)
(
void
)
addelem
(
result
,
2
,
PyInt_FromLong
(
n
->
n_lineno
));
if
(
col_offset
==
1
)
(
void
)
addelem
(
result
,
3
,
PyInt_FromLong
(
n
->
n_col_offset
));
}
return
(
result
);
}
else
{
PyErr_SetString
(
PyExc_SystemError
,
"unrecognized parse tree node type"
);
return
((
PyObject
*
)
NULL
);
}
}
/*
* End of material copyrighted by Stichting Mathematisch Centrum.
*/
/* There are two types of intermediate objects we're interested in:
* 'eval' and 'exec' types. These constants can be used in the st_type
* field of the object type to identify which any given object represents.
* These should probably go in an external header to allow other extensions
* to use them, but then, we really should be using C++ too. ;-)
*/
#define
PyST_EXPR
1
#define
PyST_SUITE
2
/* These are the internal objects and definitions required to implement the
* ST type. Most of the internal names are more reminiscent of the 'old'
* naming style, but the code uses the new naming convention.
*/
static
PyObject
*
parser_error
=
0
;
typedef
struct
{
PyObject_HEAD
/* standard object header */
node
*
st_node
;
/* the node* returned by the parser */
int
st_type
;
/* EXPR or SUITE ? */
PyCompilerFlags
st_flags
;
/* Parser and compiler flags */
}
PyST_Object
;
static
void
parser_free
(
PyST_Object
*
st
);
static
int
parser_compare
(
PyST_Object
*
left
,
PyST_Object
*
right
);
static
PyObject
*
parser_getattr
(
PyObject
*
self
,
char
*
name
);
static
PyTypeObject
PyST_Type
=
{
PyVarObject_HEAD_INIT
(
NULL
,
0
)
"parser.st"
,
/* tp_name */
(
int
)
sizeof
(
PyST_Object
),
/* tp_basicsize */
0
,
/* tp_itemsize */
(
destructor
)
parser_free
,
/* tp_dealloc */
0
,
/* tp_print */
parser_getattr
,
/* tp_getattr */
0
,
/* tp_setattr */
(
cmpfunc
)
parser_compare
,
/* tp_compare */
0
,
/* tp_repr */
0
,
/* tp_as_number */
0
,
/* tp_as_sequence */
0
,
/* tp_as_mapping */
0
,
/* tp_hash */
0
,
/* tp_call */
0
,
/* tp_str */
0
,
/* tp_getattro */
0
,
/* tp_setattro */
/* Functions to access object as input/output buffer */
0
,
/* tp_as_buffer */
Py_TPFLAGS_DEFAULT
,
/* tp_flags */
/* __doc__ */
"Intermediate representation of a Python parse tree."
};
/* PyST_Type */
static
int
parser_compare_nodes
(
node
*
left
,
node
*
right
)
{
int
j
;
if
(
TYPE
(
left
)
<
TYPE
(
right
))
return
(
-1
);
if
(
TYPE
(
right
)
<
TYPE
(
left
))
return
(
1
);
if
(
ISTERMINAL
(
TYPE
(
left
)))
return
(
strcmp
(
STR
(
left
),
STR
(
right
)));
if
(
NCH
(
left
)
<
NCH
(
right
))
return
(
-1
);
if
(
NCH
(
right
)
<
NCH
(
left
))
return
(
1
);
for
(
j
=
0
;
j
<
NCH
(
left
);
++
j
) {
int
v
=
parser_compare_nodes
(
CHILD
(
left
,
j
),
CHILD
(
right
,
j
));
if
(
v
!=
0
)
return
(
v
);
}
return
(
0
);
}
/* int parser_compare(PyST_Object* left, PyST_Object* right)
*
* Comparison function used by the Python operators ==, !=, <, >, <=, >=
* This really just wraps a call to parser_compare_nodes() with some easy
* checks and protection code.
*
*/
static
int
parser_compare
(
PyST_Object
*
left
,
PyST_Object
*
right
)
{
if
(
left
==
right
)
return
(
0
);
if
((
left
==
0
)
||
(
right
==
0
))
return
(
-1
);
return
(
parser_compare_nodes
(
left
->
st_node
,
right
->
st_node
));
}
/* parser_newstobject(node* st)
*
* Allocates a new Python object representing an ST. This is simply the
* 'wrapper' object that holds a node* and allows it to be passed around in
* Python code.
*
*/
static
PyObject
*
parser_newstobject
(
node
*
st
,
int
type
)
{
PyST_Object
*
o
=
PyObject_New
(
PyST_Object
,
&
PyST_Type
);
if
(
o
!=
0
) {
o
->
st_node
=
st
;
o
->
st_type
=
type
;
o
->
st_flags
.
cf_flags
=
0
;
}
else
{
PyNode_Free
(
st
);
}
return
((
PyObject
*
)
o
);
}
/* void parser_free(PyST_Object* st)
*
* This is called by a del statement that reduces the reference count to 0.
*
*/
static
void
parser_free
(
PyST_Object
*
st
)
{
PyNode_Free
(
st
->
st_node
);
PyObject_Del
(
st
);
}
/* parser_st2tuple(PyObject* self, PyObject* args, PyObject* kw)
*
* This provides conversion from a node* to a tuple object that can be
* returned to the Python-level caller. The ST object is not modified.
*
*/
static
PyObject
*
parser_st2tuple
(
PyST_Object
*
self
,
PyObject
*
args
,
PyObject
*
kw
)
{
PyObject
*
line_option
=
0
;
PyObject
*
col_option
=
0
;
PyObject
*
res
=
0
;
int
ok
;
static
char
*
keywords
[]
=
{
"ast"
,
"line_info"
,
"col_info"
,
NULL
};
if
(
self
==
NULL
) {
ok
=
PyArg_ParseTupleAndKeywords
(
args
,
kw
,
"O!|OO:st2tuple"
,
keywords
,
&
PyST_Type
,
&
self
,
&
line_option
,
&
col_option
);
}
else
ok
=
PyArg_ParseTupleAndKeywords
(
args
,
kw
,
"|OO:totuple"
,
&
keywords
[
1
],
&
line_option
,
&
col_option
);
if
(
ok
!=
0
) {
int
lineno
=
0
;
int
col_offset
=
0
;
if
(
line_option
!=
NULL
) {
lineno
=
(
PyObject_IsTrue
(
line_option
)
!=
0
) ?
1
:
0
;
}
if
(
col_option
!=
NULL
) {
col_offset
=
(
PyObject_IsTrue
(
col_option
)
!=
0
) ?
1
:
0
;
}
/*
* Convert ST into a tuple representation. Use Guido's function,
* since it's known to work already.
*/
res
=
node2tuple
(((
PyST_Object
*
)
self
)
->
st_node
,
PyTuple_New
,
PyTuple_SetItem
,
lineno
,
col_offset
);
}
return
(
res
);
}
static
PyObject
*
parser_ast2tuple
(
PyST_Object
*
self
,
PyObject
*
args
,
PyObject
*
kw
)
{
if
(
PyErr_WarnPy3k
(
"ast2tuple is removed in 3.x; use st2tuple"
,
1
)
<
0
)
return
NULL
;
return
parser_st2tuple
(
self
,
args
,
kw
);
}
/* parser_st2list(PyObject* self, PyObject* args, PyObject* kw)
*
* This provides conversion from a node* to a list object that can be
* returned to the Python-level caller. The ST object is not modified.
*
*/
static
PyObject
*
parser_st2list
(
PyST_Object
*
self
,
PyObject
*
args
,
PyObject
*
kw
)
{
PyObject
*
line_option
=
0
;
PyObject
*
col_option
=
0
;
PyObject
*
res
=
0
;
int
ok
;
static
char
*
keywords
[]
=
{
"ast"
,
"line_info"
,
"col_info"
,
NULL
};
if
(
self
==
NULL
)
ok
=
PyArg_ParseTupleAndKeywords
(
args
,
kw
,
"O!|OO:st2list"
,
keywords
,
&
PyST_Type
,
&
self
,
&
line_option
,
&
col_option
);
else
ok
=
PyArg_ParseTupleAndKeywords
(
args
,
kw
,
"|OO:tolist"
,
&
keywords
[
1
],
&
line_option
,
&
col_option
);
if
(
ok
) {
int
lineno
=
0
;
int
col_offset
=
0
;
if
(
line_option
!=
0
) {
lineno
=
PyObject_IsTrue
(
line_option
) ?
1
:
0
;
}
if
(
col_option
!=
NULL
) {
col_offset
=
(
PyObject_IsTrue
(
col_option
)
!=
0
) ?
1
:
0
;
}
/*
* Convert ST into a tuple representation. Use Guido's function,
* since it's known to work already.
*/
res
=
node2tuple
(
self
->
st_node
,
PyList_New
,
PyList_SetItem
,
lineno
,
col_offset
);
}
return
(
res
);
}
static
PyObject
*
parser_ast2list
(
PyST_Object
*
self
,
PyObject
*
args
,
PyObject
*
kw
)
{
if
(
PyErr_WarnPy3k
(
"ast2list is removed in 3.x; use st2list"
,
1
)
<
0
)
return
NULL
;
return
parser_st2list
(
self
,
args
,
kw
);
}
/* parser_compilest(PyObject* self, PyObject* args)
*
* This function creates code objects from the parse tree represented by
* the passed-in data object. An optional file name is passed in as well.
*
*/
static
PyObject
*
parser_compilest
(
PyST_Object
*
self
,
PyObject
*
args
,
PyObject
*
kw
)
{
PyObject
*
res
=
0
;
PyArena
*
arena
;
mod_ty
mod
;
char
*
str
=
"<syntax-tree>"
;
int
ok
;
static
char
*
keywords
[]
=
{
"ast"
,
"filename"
,
NULL
};
if
(
self
==
NULL
)
ok
=
PyArg_ParseTupleAndKeywords
(
args
,
kw
,
"O!|s:compilest"
,
keywords
,
&
PyST_Type
,
&
self
,
&
str
);
else
ok
=
PyArg_ParseTupleAndKeywords
(
args
,
kw
,
"|s:compile"
,
&
keywords
[
1
],
&
str
);
if
(
ok
) {
arena
=
PyArena_New
();
if
(
arena
) {
mod
=
PyAST_FromNode
(
self
->
st_node
,
&
(
self
->
st_flags
),
str
,
arena
);
if
(
mod
) {
res
=
(
PyObject
*
)
PyAST_Compile
(
mod
,
str
,
&
(
self
->
st_flags
),
arena
);
}
PyArena_Free
(
arena
);
}
}
return
(
res
);
}
static
PyObject
*
parser_compileast
(
PyST_Object
*
self
,
PyObject
*
args
,
PyObject
*
kw
)
{
if
(
PyErr_WarnPy3k
(
"compileast is removed in 3.x; use compilest"
,
1
)
<
0
)
return
NULL
;
return
parser_compilest
(
self
,
args
,
kw
);
}
/* PyObject* parser_isexpr(PyObject* self, PyObject* args)
* PyObject* parser_issuite(PyObject* self, PyObject* args)
*
* Checks the passed-in ST object to determine if it is an expression or
* a statement suite, respectively. The return is a Python truth value.
*
*/
static
PyObject
*
parser_isexpr
(
PyST_Object
*
self
,
PyObject
*
args
,
PyObject
*
kw
)
{
PyObject
*
res
=
0
;
int
ok
;
static
char
*
keywords
[]
=
{
"ast"
,
NULL
};
if
(
self
==
NULL
)
ok
=
PyArg_ParseTupleAndKeywords
(
args
,
kw
,
"O!:isexpr"
,
keywords
,
&
PyST_Type
,
&
self
);
else
ok
=
PyArg_ParseTupleAndKeywords
(
args
,
kw
,
":isexpr"
,
&
keywords
[
1
]);
if
(
ok
) {
/* Check to see if the ST represents an expression or not. */
res
=
(
self
->
st_type
==
PyST_EXPR
) ?
Py_True
:
Py_False
;
Py_INCREF
(
res
);
}
return
(
res
);
}
static
PyObject
*
parser_issuite
(
PyST_Object
*
self
,
PyObject
*
args
,
PyObject
*
kw
)
{
PyObject
*
res
=
0
;
int
ok
;
static
char
*
keywords
[]
=
{
"ast"
,
NULL
};
if
(
self
==
NULL
)
ok
=
PyArg_ParseTupleAndKeywords
(
args
,
kw
,
"O!:issuite"
,
keywords
,
&
PyST_Type
,
&
self
);
else
ok
=
PyArg_ParseTupleAndKeywords
(
args
,
kw
,
":issuite"
,
&
keywords
[
1
]);
if
(
ok
) {
/* Check to see if the ST represents an expression or not. */
res
=
(
self
->
st_type
==
PyST_EXPR
) ?
Py_False
:
Py_True
;
Py_INCREF
(
res
);
}
return
(
res
);
}
#define
PUBLIC_METHOD_TYPE
(METH_VARARGS|METH_KEYWORDS)
static
PyMethodDef
parser_methods
[]
=
{
{
"compile"
, (
PyCFunction
)
parser_compilest
,
PUBLIC_METHOD_TYPE
,
PyDoc_STR
(
"Compile this ST object into a code object."
)},
{
"isexpr"
, (
PyCFunction
)
parser_isexpr
,
PUBLIC_METHOD_TYPE
,
PyDoc_STR
(
"Determines if this ST object was created from an expression."
)},
{
"issuite"
, (
PyCFunction
)
parser_issuite
,
PUBLIC_METHOD_TYPE
,
PyDoc_STR
(
"Determines if this ST object was created from a suite."
)},
{
"tolist"
, (
PyCFunction
)
parser_st2list
,
PUBLIC_METHOD_TYPE
,
PyDoc_STR
(
"Creates a list-tree representation of this ST."
)},
{
"totuple"
, (
PyCFunction
)
parser_st2tuple
,
PUBLIC_METHOD_TYPE
,
PyDoc_STR
(
"Creates a tuple-tree representation of this ST."
)},
{
NULL
,
NULL
,
0
,
NULL
}
};
static
PyObject
*
parser_getattr
(
PyObject
*
self
,
char
*
name
)
{
return
(
Py_FindMethod
(
parser_methods
,
self
,
name
));
}
/* err_string(char* message)
*
* Sets the error string for an exception of type ParserError.
*
*/
static
void
err_string
(
char
*
message
)
{
PyErr_SetString
(
parser_error
,
message
);
}
/* PyObject* parser_do_parse(PyObject* args, int type)
*
* Internal function to actually execute the parse and return the result if
* successful or set an exception if not.
*
*/
static
PyObject
*
parser_do_parse
(
PyObject
*
args
,
PyObject
*
kw
,
char
*
argspec
,
int
type
)
{
char
*
string
=
0
;
PyObject
*
res
=
0
;
int
flags
=
0
;
perrdetail
err
;
static
char
*
keywords
[]
=
{
"source"
,
NULL
};
if
(
PyArg_ParseTupleAndKeywords
(
args
,
kw
,
argspec
,
keywords
,
&
string
)) {
node
*
n
=
PyParser_ParseStringFlagsFilenameEx
(
string
,
NULL
,
&
_PyParser_Grammar
,
(
type
==
PyST_EXPR
)
?
eval_input
:
file_input
,
&
err
,
&
flags
);
if
(
n
) {
res
=
parser_newstobject
(
n
,
type
);
if
(
res
)
((
PyST_Object
*
)
res
)
->
st_flags
.
cf_flags
=
flags
&
PyCF_MASK
;
}
else
PyParser_SetError
(
&
err
);
}
return
(
res
);
}
/* PyObject* parser_expr(PyObject* self, PyObject* args)
* PyObject* parser_suite(PyObject* self, PyObject* args)
*
* External interfaces to the parser itself. Which is called determines if
* the parser attempts to recognize an expression ('eval' form) or statement
* suite ('exec' form). The real work is done by parser_do_parse() above.
*
*/
static
PyObject
*
parser_expr
(
PyST_Object
*
self
,
PyObject
*
args
,
PyObject
*
kw
)
{
NOTE
(
ARGUNUSED
(
self
))
return
(
parser_do_parse
(
args
,
kw
, "
s
:
expr
",
PyST_EXPR
));
}
static
PyObject
*
parser_suite
(
PyST_Object
*
self
,
PyObject
*
args
,
PyObject
*
kw
)
{
NOTE
(
ARGUNUSED
(
self
))
return
(
parser_do_parse
(
args
,
kw
, "
s
:
suite
",
PyST_SUITE
));
}
/* This is the messy part of the code. Conversion from a tuple to an ST
* object requires that the input tuple be valid without having to rely on
* catching an exception from the compiler. This is done to allow the
* compiler itself to remain fast, since most of its input will come from
* the parser directly, and therefore be known to be syntactically correct.
* This validation is done to ensure that we don't core dump the compile
* phase, returning an exception instead.
*
* Two aspects can be broken out in this code: creating a node tree from
* the tuple passed in, and verifying that it is indeed valid. It may be
* advantageous to expand the number of ST types to include funcdefs and
* lambdadefs to take advantage of the optimizer, recognizing those STs
* here. They are not necessary, and not quite as useful in a raw form.
* For now, let's get expressions and suites working reliably.
*/
static
node
*
build_node_tree
(
PyObject
*
tuple
);
static
int
validate_expr_tree
(
node
*
tree
);
static
int
validate_file_input
(
node
*
tree
);
static
int
validate_encoding_decl
(
node
*
tree
);
/* PyObject* parser_tuple2st(PyObject* self, PyObject* args)
*
* This is the public function, called from the Python code. It receives a
* single tuple object from the caller, and creates an ST object if the
* tuple can be validated. It does this by checking the first code of the
* tuple, and, if acceptable, builds the internal representation. If this
* step succeeds, the internal representation is validated as fully as
* possible with the various validate_*() routines defined below.
*
* This function must be changed if support is to be added for PyST_FRAGMENT
* ST objects.
*
*/
static
PyObject
*
parser_tuple2st
(
PyST_Object
*
self
,
PyObject
*
args
,
PyObject
*
kw
)
{
NOTE
(
ARGUNUSED
(
self
))
PyObject
*
st
=
0
;
PyObject
*
tuple
;
node
*
tree
;
static
char
*
keywords
[]
=
{
"sequence"
,
NULL
};
if
(!
PyArg_ParseTupleAndKeywords
(
args
,
kw
,
"O:sequence2st"
,
keywords
,
&
tuple
))
return
(
0
);
if
(!
PySequence_Check
(
tuple
)) {
PyErr_SetString
(
PyExc_ValueError
,
"sequence2st() requires a single sequence argument"
);
return
(
0
);
}
/*
* Convert the tree to the internal form before checking it.
*/
tree
=
build_node_tree
(
tuple
);
if
(
tree
!=
0
) {
int
start_sym
=
TYPE
(
tree
);
if
(
start_sym
==
eval_input
) {
/* Might be an eval form. */
if
(
validate_expr_tree
(
tree
))
st
=
parser_newstobject
(
tree
,
PyST_EXPR
);
else
PyNode_Free
(
tree
);
}
else
if
(
start_sym
==
file_input
) {
/* This looks like an exec form so far. */
if
(
validate_file_input
(
tree
))
st
=
parser_newstobject
(
tree
,
PyST_SUITE
);
else
PyNode_Free
(
tree
);
}
else
if
(
start_sym
==
encoding_decl
) {
/* This looks like an encoding_decl so far. */
if
(
validate_encoding_decl
(
tree
))
st
=
parser_newstobject
(
tree
,
PyST_SUITE
);
else
PyNode_Free
(
tree
);
}
else
{
/* This is a fragment, at best. */
PyNode_Free
(
tree
);
err_string
(
"parse tree does not use a valid start symbol"
);
}
}
/* Make sure we throw an exception on all errors. We should never
* get this, but we'd do well to be sure something is done.
*/
if
(
st
==
NULL
&&
!
PyErr_Occurred
())
err_string
(
"unspecified ST error occurred"
);
return
st
;
}
static
PyObject
*
parser_tuple2ast
(
PyST_Object
*
self
,
PyObject
*
args
,
PyObject
*
kw
)
{
if
(
PyErr_WarnPy3k
(
"tuple2ast is removed in 3.x; use tuple2st"
,
1
)
<
0
)
return
NULL
;
return
parser_tuple2st
(
self
,
args
,
kw
);
}
/* node* build_node_children()
*
* Iterate across the children of the current non-terminal node and build
* their structures. If successful, return the root of this portion of
* the tree, otherwise, 0. Any required exception will be specified already,
* and no memory will have been deallocated.
*
*/
static
node
*
build_node_children
(
PyObject
*
tuple
,
node
*
root
,
int
*
line_num
)
{
Py_ssize_t
len
=
PyObject_Size
(
tuple
);
Py_ssize_t
i
;
int
err
;
for
(
i
=
1
;
i
<
len
;
++
i
) {
/* elem must always be a sequence, however simple */
PyObject
*
elem
=
PySequence_GetItem
(
tuple
,
i
);
int
ok
=
elem
!=
NULL
;
long
type
=
0
;
char
*
strn
=
0
;
if
(
ok
)
ok
=
PySequence_Check
(
elem
);
if
(
ok
) {
PyObject
*
temp
=
PySequence_GetItem
(
elem
,
0
);
if
(
temp
==
NULL
)
ok
=
0
;
else
{
ok
=
PyInt_Check
(
temp
);
if
(
ok
)
type
=
PyInt_AS_LONG
(
temp
);
Py_DECREF
(
temp
);
}
}
if
(!
ok
) {
PyObject
*
err
=
Py_BuildValue
(
"os"
,
elem
,
"Illegal node construct."
);
PyErr_SetObject
(
parser_error
,
err
);
Py_XDECREF
(
err
);
Py_XDECREF
(
elem
);
return
(
0
);
}
if
(
ISTERMINAL
(
type
)) {
Py_ssize_t
len
=
PyObject_Size
(
elem
);
PyObject
*
temp
;
if
((
len
!=
2
)
&&
(
len
!=
3
)) {
err_string
(
"terminal nodes must have 2 or 3 entries"
);
return
0
;
}
temp
=
PySequence_GetItem
(
elem
,
1
);
if
(
temp
==
NULL
)
return
0
;
if
(!
PyString_Check
(
temp
)) {
PyErr_Format
(
parser_error
,
"second item in terminal node must be a string,"
" found %s"
,
Py_TYPE
(
temp
)
->
tp_name
);
Py_DECREF
(
temp
);
return
0
;
}
if
(
len
==
3
) {
PyObject
*
o
=
PySequence_GetItem
(
elem
,
2
);
if
(
o
!=
NULL
) {
if
(
PyInt_Check
(
o
))
*
line_num
=
PyInt_AS_LONG
(
o
);
else
{
PyErr_Format
(
parser_error
,
"third item in terminal node must be an"
" integer, found %s"
,
Py_TYPE
(
temp
)
->
tp_name
);
Py_DECREF
(
o
);
Py_DECREF
(
temp
);
return
0
;
}
Py_DECREF
(
o
);
}
}
len
=
PyString_GET_SIZE
(
temp
)
+
1
;
strn
=
(
char
*
)
PyObject_MALLOC
(
len
);
if
(
strn
!=
NULL
)
(
void
)
memcpy
(
strn
,
PyString_AS_STRING
(
temp
),
len
);
Py_DECREF
(
temp
);
}
else
if
(!
ISNONTERMINAL
(
type
)) {
/*
* It has to be one or the other; this is an error.
* Throw an exception.
*/
PyObject
*
err
=
Py_BuildValue
(
"os"
,
elem
,
"unknown node type."
);
PyErr_SetObject
(
parser_error
,
err
);
Py_XDECREF
(
err
);
Py_XDECREF
(
elem
);
return
(
0
);
}
err
=
PyNode_AddChild
(
root
,
type
,
strn
,
*
line_num
,
0
);
if
(
err
==
E_NOMEM
) {
PyObject_FREE
(
strn
);
return
(
node
*
)
PyErr_NoMemory
();
}
if
(
err
==
E_OVERFLOW
) {
PyObject_FREE
(
strn
);
PyErr_SetString
(
PyExc_ValueError
,
"unsupported number of child nodes"
);
return
NULL
;
}
if
(
ISNONTERMINAL
(
type
)) {
node
*
new_child
=
CHILD
(
root
,
i
-
1
);
if
(
new_child
!=
build_node_children
(
elem
,
new_child
,
line_num
)) {
Py_XDECREF
(
elem
);
return
(
0
);
}
}
else
if
(
type
==
NEWLINE
) {
/* It's true: we increment the */
++
(
*
line_num
);
/* line number *after* the newline! */
}
Py_XDECREF
(
elem
);
}
return
root
;
}
static
node
*
build_node_tree
(
PyObject
*
tuple
)
{
node
*
res
=
0
;
PyObject
*
temp
=
PySequence_GetItem
(
tuple
,
0
);
long
num
=
-1
;
if
(
temp
!=
NULL
)
num
=
PyInt_AsLong
(
temp
);
Py_XDECREF
(
temp
);
if
(
ISTERMINAL
(
num
)) {
/*
* The tuple is simple, but it doesn't start with a start symbol.
* Throw an exception now and be done with it.
*/
tuple
=
Py_BuildValue
(
"os"
,
tuple
,
"Illegal syntax-tree; cannot start with terminal symbol."
);
PyErr_SetObject
(
parser_error
,
tuple
);
Py_XDECREF
(
tuple
);
}
else
if
(
ISNONTERMINAL
(
num
)) {
/*
* Not efficient, but that can be handled later.
*/
int
line_num
=
0
;
PyObject
*
encoding
=
NULL
;
if
(
num
==
encoding_decl
) {
encoding
=
PySequence_GetItem
(
tuple
,
2
);
/* tuple isn't borrowed anymore here, need to DECREF */
tuple
=
PySequence_GetSlice
(
tuple
,
0
,
2
);
}
res
=
PyNode_New
(
num
);
if
(
res
!=
NULL
) {
if
(
res
!=
build_node_children
(
tuple
,
res
,
&
line_num
)) {
PyNode_Free
(
res
);
res
=
NULL
;
}
if
(
res
&&
encoding
) {
Py_ssize_t
len
;
len
=
PyString_GET_SIZE
(
encoding
)
+
1
;
res
->
n_str
=
(
char
*
)
PyObject_MALLOC
(
len
);
if
(
res
->
n_str
!=
NULL
)
(
void
)
memcpy
(
res
->
n_str
,
PyString_AS_STRING
(
encoding
),
len
);
Py_DECREF
(
encoding
);
Py_DECREF
(
tuple
);
}
}
}
else
{
/* The tuple is illegal -- if the number is neither TERMINAL nor
* NONTERMINAL, we can't use it. Not sure the implementation
* allows this condition, but the API doesn't preclude it.
*/
PyObject
*
err
=
Py_BuildValue
(
"os"
,
tuple
,
"Illegal component tuple."
);
PyErr_SetObject
(
parser_error
,
err
);
Py_XDECREF
(
err
);
}
return
(
res
);
}
/*
* Validation routines used within the validation section:
*/
static
int
validate_terminal
(
node
*
terminal
,
int
type
,
char
*
string
);
#define
validate_ampersand
(
ch
) validate_terminal(ch, AMPER, "&")
#define
validate_circumflex
(
ch
) validate_terminal(ch, CIRCUMFLEX, "^")
#define
validate_colon
(
ch
) validate_terminal(ch, COLON, ":")
#define
validate_comma
(
ch
) validate_terminal(ch, COMMA, ",")
#define
validate_dedent
(
ch
) validate_terminal(ch, DEDENT, "")
#define
validate_equal
(
ch
) validate_terminal(ch, EQUAL, "=")
#define
validate_indent
(
ch
) validate_terminal(ch, INDENT, (char*)NULL)
#define
validate_lparen
(
ch
) validate_terminal(ch, LPAR, "(")
#define
validate_newline
(
ch
) validate_terminal(ch, NEWLINE, (char*)NULL)
#define
validate_rparen
(
ch
) validate_terminal(ch, RPAR, ")")
#define
validate_semi
(
ch
) validate_terminal(ch, SEMI, ";")
#define
validate_star
(
ch
) validate_terminal(ch, STAR, "*")
#define
validate_vbar
(
ch
) validate_terminal(ch, VBAR, "|")
#define
validate_doublestar
(
ch
) validate_terminal(ch, DOUBLESTAR, "**")
#define
validate_dot
(
ch
) validate_terminal(ch, DOT, ".")
#define
validate_at
(
ch
) validate_terminal(ch, AT, "@")
#define
validate_name
(
ch
,
str
) validate_terminal(ch, NAME, str)
#define
VALIDATER
(
n
) static int validate_##n(node *tree)
VALIDATER
(
node
);
VALIDATER
(
small_stmt
);
VALIDATER
(
class
);
VALIDATER
(
node
);
VALIDATER
(
parameters
);
VALIDATER
(
suite
);
VALIDATER
(
testlist
);
VALIDATER
(
varargslist
);
VALIDATER
(
fpdef
);
VALIDATER
(
fplist
);
VALIDATER
(
stmt
);
VALIDATER
(
simple_stmt
);
VALIDATER
(
expr_stmt
);
VALIDATER
(
power
);
VALIDATER
(
print_stmt
);
VALIDATER
(
del_stmt
);
VALIDATER
(
return_stmt
);
VALIDATER
(
list_iter
);
VALIDATER
(
raise_stmt
);
VALIDATER
(
import_stmt
);
VALIDATER
(
import_name
);
VALIDATER
(
import_from
);
VALIDATER
(
global_stmt
);
VALIDATER
(
list_if
);
VALIDATER
(
assert_stmt
);
VALIDATER
(
list_for
);
VALIDATER
(
exec_stmt
);
VALIDATER
(
compound_stmt
);
VALIDATER
(
while
);
VALIDATER
(
for
);
VALIDATER
(
try
);
VALIDATER
(
except_clause
);
VALIDATER
(
test
);
VALIDATER
(
and_test
);
VALIDATER
(
not_test
);
VALIDATER
(
comparison
);
VALIDATER
(
comp_op
);
VALIDATER
(
expr
);
VALIDATER
(
xor_expr
);
VALIDATER
(
and_expr
);
VALIDATER
(
shift_expr
);
VALIDATER
(
arith_expr
);
VALIDATER
(
term
);
VALIDATER
(
factor
);
VALIDATER
(
atom
);
VALIDATER
(
lambdef
);
VALIDATER
(
trailer
);
VALIDATER
(
subscript
);
VALIDATER
(
subscriptlist
);
VALIDATER
(
sliceop
);
VALIDATER
(
exprlist
);
VALIDATER
(
dictmaker
);
VALIDATER
(
arglist
);
VALIDATER
(
argument
);
VALIDATER
(
listmaker
);
VALIDATER
(
yield_stmt
);
VALIDATER
(
testlist1
);
VALIDATER
(
gen_for
);
VALIDATER
(
gen_iter
);
VALIDATER
(
gen_if
);
VALIDATER
(
testlist_gexp
);
VALIDATER
(
yield_expr
);
VALIDATER
(
yield_or_testlist
);
VALIDATER
(
or_test
);
VALIDATER
(
old_test
);
VALIDATER
(
old_lambdef
);
#undef
VALIDATER
#define
is_even
(
n
) (((n) & 1) == 0)
#define
is_odd
(
n
) (((n) & 1) == 1)
static
int
validate_ntype
(
node
*
n
,
int
t
)
{
if
(
TYPE
(
n
)
!=
t
) {
PyErr_Format
(
parser_error
,
"Expected node type %d, got %d."
,
t
,
TYPE
(
n
));
return
0
;
}
return
1
;
}
/* Verifies that the number of child nodes is exactly 'num', raising
* an exception if it isn't. The exception message does not indicate
* the exact number of nodes, allowing this to be used to raise the
* "right" exception when the wrong number of nodes is present in a
* specific variant of a statement's syntax. This is commonly used
* in that fashion.
*/
static
int
validate_numnodes
(
node
*
n
,
int
num
,
const
char
*
const
name
)
{
if
(
NCH
(
n
)
!=
num
) {
PyErr_Format
(
parser_error
,
"Illegal number of children for %s node."
,
name
);
return
0
;
}
return
1
;
}
static
int
validate_terminal
(
node
*
terminal
,
int
type
,
char
*
string
)
{
int
res
=
(
validate_ntype
(
terminal
,
type
)
&&
((
string
==
0
)
||
(
strcmp
(
string
,
STR
(
terminal
))
==
0
)));
if
(!
res
&&
!
PyErr_Occurred
()) {
PyErr_Format
(
parser_error
,
"Illegal terminal: expected \"%s\""
,
string
);
}
return
(
res
);
}
/* X (',' X) [',']
*/
static
int
View remainder of file in raw view
Back
|
FazBrowse Home
|
New Git URL