Skip to content
Projeler
Gruplar
Parçacıklar
Yardım
Yükleniyor...
Oturum aç / Kaydol
Gezinmeyi değiştir
C
cpython
Proje
Proje
Ayrıntılar
Etkinlik
Cycle Analytics
Depo (repository)
Depo (repository)
Dosyalar
Kayıtlar (commit)
Dallar (branch)
Etiketler
Katkıda bulunanlar
Grafik
Karşılaştır
Grafikler
Konular (issue)
0
Konular (issue)
0
Liste
Pano
Etiketler
Kilometre Taşları
Birleştirme (merge) Talepleri
0
Birleştirme (merge) Talepleri
0
CI / CD
CI / CD
İş akışları (pipeline)
İşler
Zamanlamalar
Grafikler
Paketler
Paketler
Wiki
Wiki
Parçacıklar
Parçacıklar
Üyeler
Üyeler
Collapse sidebar
Close sidebar
Etkinlik
Grafik
Grafikler
Yeni bir konu (issue) oluştur
İşler
Kayıtlar (commit)
Konu (issue) Panoları
Kenar çubuğunu aç
Batuhan Osman TASKAYA
cpython
Commits
256a550c
Kaydet (Commit)
256a550c
authored
Mar 31, 2001
tarafından
Moshe Zadka
Dosyalara gözat
Seçenekler
Dosyalara Gözat
İndir
Eposta Yamaları
Sade Fark
#125375 - parsermodule.c - fix parser.tuple2ast() failure on valid parse tree
üst
2c476bb2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
22 additions
and
11 deletions
+22
-11
NEWS
Misc/NEWS
+2
-0
parsermodule.c
Modules/parsermodule.c
+20
-11
No files found.
Misc/NEWS
Dosyayı görüntüle @
256a550c
...
@@ -98,6 +98,8 @@ http://sourceforge.net/tracker/index.php?func=detail&aid=<id>&group_id=5470&atid
...
@@ -98,6 +98,8 @@ http://sourceforge.net/tracker/index.php?func=detail&aid=<id>&group_id=5470&atid
- curses.ascii - space (ASCII 32) is now considered whitespace
- curses.ascii - space (ASCII 32) is now considered whitespace
- #125375 - parsermodule.c - fix parser.tuple2ast() failure on valid parse tree
What's New in Python 2.0?
What's New in Python 2.0?
=========================
=========================
...
...
Modules/parsermodule.c
Dosyayı görüntüle @
256a550c
...
@@ -1098,12 +1098,17 @@ validate_varargslist(node *tree)
...
@@ -1098,12 +1098,17 @@ validate_varargslist(node *tree)
int
res
=
validate_ntype
(
tree
,
varargslist
)
&&
(
nch
!=
0
);
int
res
=
validate_ntype
(
tree
,
varargslist
)
&&
(
nch
!=
0
);
int
sym
;
int
sym
;
if
(
!
res
)
return
0
;
if
(
nch
<
1
)
{
if
(
nch
<
1
)
{
err_string
(
"varargslist missing child nodes"
);
err_string
(
"varargslist missing child nodes"
);
return
0
;
return
0
;
}
}
sym
=
TYPE
(
CHILD
(
tree
,
0
));
sym
=
TYPE
(
CHILD
(
tree
,
0
));
if
(
sym
==
STAR
||
sym
==
DOUBLESTAR
)
if
(
sym
==
STAR
||
sym
==
DOUBLESTAR
)
/* whole thing matches:
* '*' NAME [',' '**' NAME] | '**' NAME
*/
res
=
validate_varargslist_trailer
(
tree
,
0
);
res
=
validate_varargslist_trailer
(
tree
,
0
);
else
if
(
sym
==
fpdef
)
{
else
if
(
sym
==
fpdef
)
{
int
i
=
0
;
int
i
=
0
;
...
@@ -1127,11 +1132,16 @@ validate_varargslist(node *tree)
...
@@ -1127,11 +1132,16 @@ validate_varargslist(node *tree)
}
}
if
(
res
&&
i
<
nch
)
{
if
(
res
&&
i
<
nch
)
{
res
=
validate_comma
(
CHILD
(
tree
,
i
));
res
=
validate_comma
(
CHILD
(
tree
,
i
));
if
(
res
)
++
i
;
++
i
;
if
(
res
&&
i
<
nch
&&
(
TYPE
(
CHILD
(
tree
,
i
))
==
DOUBLESTAR
||
TYPE
(
CHILD
(
tree
,
i
))
==
STAR
))
break
;
}
}
}
}
/* handle '*' NAME [',' '**' NAME] | '**' NAME */
/* ... '*' NAME [',' '**' NAME] | '**' NAME
* i --^^^
*/
if
(
res
)
if
(
res
)
res
=
validate_varargslist_trailer
(
tree
,
i
);
res
=
validate_varargslist_trailer
(
tree
,
i
);
}
}
...
@@ -1139,6 +1149,7 @@ validate_varargslist(node *tree)
...
@@ -1139,6 +1149,7 @@ validate_varargslist(node *tree)
/*
/*
* fpdef ['=' test] (',' fpdef ['=' test])* [',']
* fpdef ['=' test] (',' fpdef ['=' test])* [',']
*/
*/
/* strip trailing comma node */
if
(
sym
==
COMMA
)
{
if
(
sym
==
COMMA
)
{
res
=
validate_comma
(
CHILD
(
tree
,
nch
-
1
));
res
=
validate_comma
(
CHILD
(
tree
,
nch
-
1
));
if
(
!
res
)
if
(
!
res
)
...
@@ -1150,9 +1161,9 @@ validate_varargslist(node *tree)
...
@@ -1150,9 +1161,9 @@ validate_varargslist(node *tree)
*/
*/
res
=
validate_fpdef
(
CHILD
(
tree
,
0
));
res
=
validate_fpdef
(
CHILD
(
tree
,
0
));
++
i
;
++
i
;
if
(
res
&&
(
i
+
2
<
nch
)
&&
TYPE
(
CHILD
(
tree
,
1
))
==
EQUAL
)
{
if
(
res
&&
(
i
+
2
<
=
nch
)
&&
TYPE
(
CHILD
(
tree
,
i
))
==
EQUAL
)
{
res
=
(
validate_equal
(
CHILD
(
tree
,
1
))
res
=
(
validate_equal
(
CHILD
(
tree
,
i
))
&&
validate_test
(
CHILD
(
tree
,
2
)));
&&
validate_test
(
CHILD
(
tree
,
i
+
1
)));
i
+=
2
;
i
+=
2
;
}
}
/*
/*
...
@@ -1163,12 +1174,10 @@ validate_varargslist(node *tree)
...
@@ -1163,12 +1174,10 @@ validate_varargslist(node *tree)
res
=
(
validate_comma
(
CHILD
(
tree
,
i
))
res
=
(
validate_comma
(
CHILD
(
tree
,
i
))
&&
validate_fpdef
(
CHILD
(
tree
,
i
+
1
)));
&&
validate_fpdef
(
CHILD
(
tree
,
i
+
1
)));
i
+=
2
;
i
+=
2
;
if
(
res
&&
(
nch
-
i
)
>=
2
if
(
res
&&
(
nch
-
i
)
>=
2
&&
TYPE
(
CHILD
(
tree
,
i
))
==
EQUAL
)
{
&&
TYPE
(
CHILD
(
tree
,
i
))
==
COMMA
)
{
res
=
(
validate_equal
(
CHILD
(
tree
,
i
))
res
=
(
validate_comma
(
CHILD
(
tree
,
i
))
&&
validate_test
(
CHILD
(
tree
,
i
+
1
)));
&&
validate_test
(
CHILD
(
tree
,
i
+
1
)));
if
(
res
)
i
+=
2
;
i
+=
2
;
}
}
}
}
if
(
res
&&
nch
-
i
!=
0
)
{
if
(
res
&&
nch
-
i
!=
0
)
{
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment