This repository has been archived by the owner on Mar 7, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathpy2cs.py
1673 lines (1456 loc) · 56.6 KB
/
py2cs.py
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
#!/usr/bin/env python
'''
This script makes a coffeescript file for every python source file listed
on the command line (wildcard file names are supported).
For full details, see README.md.
Released under the MIT License.
Written by Edward K. Ream.
Hosted at: https://github.com/edreamleo/python-to-coffeescript
'''
# All parts of this script are distributed under the following copyright. This is intended to be the same as the MIT license, namely that this script is absolutely free, even for commercial use, including resale. There is no GNU-like "copyleft" restriction. This license is compatible with the GPL.
#
# **Copyright 2016 by Edward K. Ream. All Rights Reserved.**
#
# Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
#
# The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
#
# **THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.**
import ast
import glob
import optparse
import os
import sys
import time
import token as token_module
import tokenize
import types
try:
import ConfigParser as configparser # Python 2
except ImportError:
import configparser # Python 3
try:
import StringIO as io # Python 2
except ImportError:
import io # Python 3
isPython3 = sys.version_info >= (3, 0, 0)
def main():
'''
The driver for the stand-alone version of make-stub-files.
All options come from ~/stubs/make_stub_files.cfg.
'''
# g.cls()
controller = MakeCoffeeScriptController()
controller.scan_command_line()
controller.scan_options()
controller.run()
print('done')
#
# Utility functions...
#
def dump(title, s=None):
if s:
print('===== %s...\n%s\n' % (title, s.rstrip()))
else:
print('===== %s...\n' % title)
def dump_dict(title, d):
'''Dump a dictionary with a header.'''
dump(title)
for z in sorted(d):
print('%30s %s' % (z, d.get(z)))
print('')
def dump_list(title, aList):
'''Dump a list with a header.'''
dump(title)
for z in aList:
print(z)
print('')
def op_name(node,strict=True):
'''Return the print name of an operator node.'''
d = {
# Binary operators.
'Add': '+',
'BitAnd': '&',
'BitOr': '|',
'BitXor': '^',
'Div': '/',
'FloorDiv': '//',
'LShift': '<<',
'Mod': '%',
'Mult': '*',
'Pow': '**',
'RShift': '>>',
'Sub': '-',
# Boolean operators.
'And': ' and ',
'Or': ' or ',
# Comparison operators
'Eq': '==',
'Gt': '>',
'GtE': '>=',
'In': ' in ',
'Is': ' is ',
'IsNot': ' is not ',
'Lt': '<',
'LtE': '<=',
'NotEq': '!=',
'NotIn': ' not in ',
# Context operators.
'AugLoad': '<AugLoad>',
'AugStore': '<AugStore>',
'Del': '<Del>',
'Load': '<Load>',
'Param': '<Param>',
'Store': '<Store>',
# Unary operators.
'Invert': '~',
'Not': ' not ',
'UAdd': '+',
'USub': '-',
}
kind = node.__class__.__name__
name = d.get(kind,'<%s>' % kind)
if strict: assert name, kind
return name
def pdb(self):
'''Invoke a debugger during unit testing.'''
try:
import leo.core.leoGlobals as leo_g
leo_g.pdb()
except ImportError:
import pdb
pdb.set_trace()
def truncate(s, n):
'''Return s truncated to n characters.'''
return s if len(s) <= n else s[:n-3] + '...'
class CoffeeScriptTraverser(object):
'''A class to convert python sources to coffeescript sources.'''
# pylint: disable=consider-using-enumerate
def __init__(self, controller):
'''Ctor for CoffeeScriptFormatter class.'''
self.controller = controller
self.class_stack = []
# Redirection. Set in format.
self.sync_string = None
self.last_node = None
self.leading_lines = None
self.leading_string = None
self.tokens_for_statement = None
self.trailing_comment = None
self.trailing_comment_at_lineno = None
def format(self, node, s, tokens):
'''Format the node (or list of nodes) and its descendants.'''
self.level = 0
self.sync = sync = TokenSync(s, tokens)
# Create aliases here for convenience.
self.sync_string = sync.sync_string
self.last_node = sync.last_node
self.leading_lines = sync.leading_lines
self.leading_string = sync.leading_string
self.tokens_for_statment = sync.tokens_for_statement
self.trailing_comment = sync.trailing_comment
self.trailing_comment_at_lineno = sync.trailing_comment_at_lineno
# Compute the result.
val = self.visit(node)
sync.check_strings()
# if isinstance(val, list): # testing:
# val = ' '.join(val)
val += ''.join(sync.trailing_lines())
return val or ''
def indent(self, s):
'''Return s, properly indented.'''
# assert not s.startswith('\n'), (g.callers(), repr(s))
n = 0
while s and s.startswith('\n'):
n += 1
s = s[1:]
return '%s%s%s' % ('\n' * n, ' ' * 4 * self.level, s)
def visit(self, node):
'''Return the formatted version of an Ast node, or list of Ast nodes.'''
name = node.__class__.__name__
if isinstance(node, (list, tuple)):
return ', '.join([self.visit(z) for z in node])
elif node is None:
return 'None'
else:
assert isinstance(node, ast.AST), name
method = getattr(self, 'do_' + name)
s = method(node)
# pylint: disable = undefined-variable
if isPython3:
assert isinstance(s, str)
else:
assert isinstance(s, (str, unicode))
return s
#
# CoffeeScriptTraverser contexts...
#
# 2: ClassDef(identifier name, expr* bases,
# stmt* body, expr* decorator_list)
# 3: ClassDef(identifier name, expr* bases,
# keyword* keywords, expr? starargs, expr? kwargs
# stmt* body, expr* decorator_list)
#
# keyword arguments supplied to call (NULL identifier for **kwargs)
# keyword = (identifier? arg, expr value)
def do_ClassDef(self, node):
result = self.leading_lines(node)
tail = self.trailing_comment(node)
name = node.name # Only a plain string is valid.
bases = [self.visit(z) for z in node.bases] if node.bases else []
if getattr(node, 'keywords', None): # Python 3
for keyword in node.keywords:
bases.append('%s=%s' % (keyword.arg, self.visit(keyword.value)))
if getattr(node, 'starargs', None): # Python 3
bases.append('*%s', self.visit(node.starargs))
if getattr(node, 'kwargs', None): # Python 3
bases.append('*%s', self.visit(node.kwargs))
if bases:
s = 'class %s extends %s' % (name, ', '.join(bases))
else:
s = 'class %s' % name
result.append(self.indent(s + tail))
self.class_stack.append(name)
for i, z in enumerate(node.body):
self.level += 1
result.append(self.visit(z))
self.level -= 1
self.class_stack.pop()
return ''.join(result)
# 2: FunctionDef(identifier name, arguments args, stmt* body, expr* decorator_list)
# 3: FunctionDef(identifier name, arguments args, stmt* body, expr* decorator_list,
# expr? returns)
def do_FunctionDef(self, node):
'''Format a FunctionDef node.'''
result = self.leading_lines(node)
if node.decorator_list:
for z in node.decorator_list:
tail = self.trailing_comment(z)
s = '@%s' % self.visit(z)
result.append(self.indent(s + tail))
name = node.name # Only a plain string is valid.
args = self.visit(node.args) if node.args else ''
args = [z.strip() for z in args.split(',')]
if self.class_stack and args and args[0] == '@':
args = args[1:]
args = ', '.join(args)
args = '(%s) ' % args if args else ''
# Traverse node.returns to keep strings in sync.
if getattr(node, 'returns', None):
self.visit(node.returns)
tail = self.trailing_comment(node)
sep = ': ' if self.class_stack else ' = '
s = '%s%s%s->%s' % (name, sep, args, tail)
result.append(self.indent(s))
for i, z in enumerate(node.body):
self.level += 1
result.append(self.visit(z))
self.level -= 1
return ''.join(result)
def do_Interactive(self, node):
for z in node.body:
self.visit(z)
def do_Module(self, node):
return ''.join([self.visit(z) for z in node.body])
def do_Lambda(self, node):
return self.indent('lambda %s: %s' % (
self.visit(node.args),
self.visit(node.body)))
#
# CoffeeScriptTraverser expressions...
#
def do_Expression(self, node):
'''An inner expression: do not indent.'''
return '%s\n' % self.visit(node.body)
def do_GeneratorExp(self, node):
elt = self.visit(node.elt) or ''
gens = [self.visit(z) for z in node.generators]
gens = [z if z else '<**None**>' for z in gens] # Kludge: probable bug.
return '<gen %s for %s>' % (elt, ','.join(gens))
#
# CoffeeScriptTraverser operands...
#
# 2: arguments = (expr* args, identifier? vararg,
# identifier? kwarg, expr* defaults)
# 3: arguments = (arg* args, arg? vararg,
# arg* kwonlyargs, expr* kw_defaults,
# arg? kwarg, expr* defaults)
def do_arguments(self, node):
'''Format the arguments node.'''
assert isinstance(node, ast.arguments)
args = [self.visit(z) for z in node.args]
defaults = [self.visit(z) for z in node.defaults]
# Assign default values to the last args.
args2 = []
n_plain = len(args) - len(defaults)
for i in range(len(args)):
if i < n_plain:
args2.append(args[i])
else:
args2.append('%s=%s' % (args[i], defaults[i - n_plain]))
if isPython3:
# pylint: disable=no-member
args = [self.visit(z) for z in node.kwonlyargs]
defaults = [self.visit(z) for z in node.kw_defaults]
n_plain = len(args) - len(defaults)
for i in range(len(args)):
if i < n_plain:
args2.append(args[i])
else:
args2.append('%s=%s' % (args[i], defaults[i - n_plain]))
# Add the vararg and kwarg expressions.
if getattr(node, 'vararg', None):
args2.append('*' + self.visit(node.vararg))
if getattr(node, 'kwarg', None):
args2.append('**' + self.visit(node.kwarg))
else:
# Add the vararg and kwarg names.
if getattr(node, 'vararg', None):
args2.append('*' + node.vararg)
if getattr(node, 'kwarg', None):
args2.append('**' + node.kwarg)
return ','.join(args2)
# 3: arg = (identifier arg, expr? annotation)
def do_arg(self, node):
# Visit the node.annotation to keep strings in synch.
if getattr(node, 'annotation', None):
self.visit(node.annotation)
return node.arg
# Attribute(expr value, identifier attr, expr_context ctx)
def do_Attribute(self, node):
# Don't visit node.attr: it is always a string.
val = self.visit(node.value)
val = '@' if val == '@' else val + '.'
return val + node.attr
def do_Bytes(self, node): # Python 3.x only.
if hasattr(node, 'lineno'):
# Do *not* handle leading lines here.
# leading = self.leading_string(node)
return self.sync_string(node)
else:
g.trace('==== no lineno', node.s)
return node.s
# Call(expr func, expr* args, keyword* keywords, expr? starargs, expr? kwargs)
def do_Call(self, node):
func = self.visit(node.func)
args = [self.visit(z) for z in node.args]
for z in node.keywords:
# Calls f.do_keyword.
args.append(self.visit(z))
if getattr(node, 'starargs', None):
args.append('*%s' % (self.visit(node.starargs)))
if getattr(node, 'kwargs', None):
args.append('**%s' % (self.visit(node.kwargs)))
args = [z for z in args if z] # Kludge: Defensive coding.
s = '%s(%s)' % (func, ','.join(args))
return s
# keyword = (identifier arg, expr value)
def do_keyword(self, node):
# node.arg is a string.
value = self.visit(node.value)
# This is a keyword *arg*, not a Python keyword!
return '%s=%s' % (node.arg, value)
def do_comprehension(self, node):
result = []
name = self.visit(node.target) # A name.
it = self.visit(node.iter) # An attribute.
result.append('%s in %s' % (name, it))
ifs = [self.visit(z) for z in node.ifs]
if ifs:
result.append(' if %s' % (''.join(ifs)))
return ''.join(result)
def do_Dict(self, node):
assert len(node.keys) == len(node.values)
items, result = [], []
result.append('{')
self.level += 1
for i, key in enumerate(node.keys):
head = self.leading_lines(key)
# Prevents leading lines from being handled again.
head = [z for z in head if z.strip()]
# Ignore blank lines.
if head:
items.extend('\n'+''.join(head))
tail = self.trailing_comment(node.values[i])
key = self.visit(node.keys[i])
value = self.visit(node.values[i])
s = '%s:%s%s' % (key, value, tail)
items.append(self.indent(s))
self.level -= 1
result.extend(items)
if items:
result.append(self.indent('}'))
else:
result.append('}')
return ''.join(result)
def do_Ellipsis(self, node):
return '...'
def do_ExtSlice(self, node):
return ':'.join([self.visit(z) for z in node.dims])
def do_Index(self, node):
return self.visit(node.value)
def do_List(self, node):
# Not used: list context.
# self.visit(node.ctx)
elts = [self.visit(z) for z in node.elts]
elst = [z for z in elts if z] # Defensive.
return '[%s]' % ','.join(elts)
def do_ListComp(self, node):
elt = self.visit(node.elt)
gens = [self.visit(z) for z in node.generators]
gens = [z if z else '<**None**>' for z in gens] # Kludge: probable bug.
return '%s for %s' % (elt, ''.join(gens))
def do_Name(self, node):
return '@' if node.id == 'self' else node.id
def do_NameConstant(self, node): # Python 3 only.
s = repr(node.value)
return 'bool' if s in ('True', 'False') else s
def do_Num(self, node):
return repr(node.n)
# Python 2.x only
def do_Repr(self, node):
return 'repr(%s)' % self.visit(node.value)
def do_Slice(self, node):
lower, upper, step = '', '', ''
if getattr(node, 'lower', None) is not None:
lower = self.visit(node.lower)
if getattr(node, 'upper', None) is not None:
upper = self.visit(node.upper)
if getattr(node, 'step', None) is not None:
step = self.visit(node.step)
if step:
return '%s:%s:%s' % (lower, upper, step)
else:
return '%s:%s' % (lower, upper)
def do_Str(self, node):
'''A string constant, including docstrings.'''
if hasattr(node, 'lineno'):
# Do *not* handle leading lines here.
# leading = self.leading_string(node)
return self.sync_string(node)
else:
g.trace('==== no lineno', node.s)
return node.s
# Subscript(expr value, slice slice, expr_context ctx)
def do_Subscript(self, node):
value = self.visit(node.value)
the_slice = self.visit(node.slice)
return '%s[%s]' % (value, the_slice)
def do_Tuple(self, node):
elts = [self.visit(z) for z in node.elts]
return '(%s)' % ', '.join(elts)
#
# CoffeeScriptTraverser operators...
#
def do_BinOp(self, node):
return '%s%s%s' % (
self.visit(node.left),
op_name(node.op),
self.visit(node.right))
def do_BoolOp(self, node):
values = [self.visit(z) for z in node.values]
return op_name(node.op).join(values)
def do_Compare(self, node):
result = []
lt = self.visit(node.left)
ops = [op_name(z) for z in node.ops]
comps = [self.visit(z) for z in node.comparators]
result.append(lt)
if len(ops) == len(comps):
for i in range(len(ops)):
result.append('%s%s' % (ops[i], comps[i]))
else:
print('can not happen: ops', repr(ops), 'comparators', repr(comps))
return ''.join(result)
def do_IfExp(self, node):
return '%s if %s else %s ' % (
self.visit(node.body),
self.visit(node.test),
self.visit(node.orelse))
def do_UnaryOp(self, node):
return '%s%s' % (
op_name(node.op),
self.visit(node.operand))
#
# CoffeeScriptTraverser statements...
#
def tail_after_body(self, body, aList, result):
'''
Return the tail of the 'else' or 'finally' statement following the given body.
aList is the node.orelse or node.finalbody list.
'''
node = self.last_node(body)
if node:
max_n = node.lineno
leading = self.leading_lines(aList[0])
if leading:
result.extend(leading)
max_n += len(leading)
tail = self.trailing_comment_at_lineno(max_n + 1)
else:
tail = '\n'
return tail
def do_Assert(self, node):
head = self.leading_string(node)
tail = self.trailing_comment(node)
test = self.visit(node.test)
if getattr(node, 'msg', None) is not None:
s = 'assert %s, %s' % (test, self.visit(node.msg))
else:
s = 'assert %s' % test
return head + self.indent(s) + tail
def do_Assign(self, node):
head = self.leading_string(node)
tail = self.trailing_comment(node)
s = '%s=%s' % (
'='.join([self.visit(z) for z in node.targets]),
self.visit(node.value))
return head + self.indent(s) + tail
def do_AugAssign(self, node):
head = self.leading_string(node)
tail = self.trailing_comment(node)
s = '%s%s=%s' % (
self.visit(node.target),
op_name(node.op),
self.visit(node.value))
return head + self.indent(s) + tail
def do_Break(self, node):
head = self.leading_string(node)
tail = self.trailing_comment(node)
return head + self.indent('break') + tail
def do_Continue(self, node):
head = self.leading_lines(node)
tail = self.trailing_comment(node)
return head + self.indent('continue') + tail
def do_Delete(self, node):
head = self.leading_string(node)
tail = self.trailing_comment(node)
targets = [self.visit(z) for z in node.targets]
s = 'del %s' % ','.join(targets)
return head + self.indent(s) + tail
def do_ExceptHandler(self, node):
result = self.leading_lines(node)
tail = self.trailing_comment(node)
result.append(self.indent('except'))
if getattr(node, 'type', None):
result.append(' %s' % self.visit(node.type))
if getattr(node, 'name', None):
if isinstance(node.name, ast.AST):
result.append(' as %s' % self.visit(node.name))
else:
result.append(' as %s' % node.name) # Python 3.x.
result.append(':' + tail)
for z in node.body:
self.level += 1
result.append(self.visit(z))
self.level -= 1
return ''.join(result)
# Python 2.x only
def do_Exec(self, node):
head = self.leading_string(node)
tail = self.trailing_comment(node)
body = self.visit(node.body)
args = [] # Globals before locals.
if getattr(node, 'globals', None):
args.append(self.visit(node.globals))
if getattr(node, 'locals', None):
args.append(self.visit(node.locals))
if args:
s = 'exec %s in %s' % (body, ','.join(args))
else:
s = 'exec %s' % body
return head + self.indent(s) + tail
def do_Expr(self, node):
'''An outer expression: must be indented.'''
head = self.leading_string(node)
tail = self.trailing_comment(node)
s = '%s' % self.visit(node.value)
return head + self.indent(s) + tail
def do_For(self, node):
result = self.leading_lines(node)
tail = self.trailing_comment(node)
s = 'for %s in %s:' % (
self.visit(node.target),
self.visit(node.iter))
result.append(self.indent(s + tail))
for z in node.body:
self.level += 1
result.append(self.visit(z))
self.level -= 1
if node.orelse:
tail = self.tail_after_body(node.body, node.orelse, result)
result.append(self.indent('else:' + tail))
for z in node.orelse:
self.level += 1
result.append(self.visit(z))
self.level -= 1
return ''.join(result)
def do_Global(self, node):
head = self.leading_lines(node)
tail = self.trailing_comment(node)
s = 'global %s' % ','.join(node.names)
return head + self.indent(s) + tail
def do_If(self, node):
result = self.leading_lines(node)
tail = self.trailing_comment(node)
s = 'if %s:%s' % (self.visit(node.test), tail)
result.append(self.indent(s))
for z in node.body:
self.level += 1
result.append(self.visit(z))
self.level -= 1
if node.orelse:
tail = self.tail_after_body(node.body, node.orelse, result)
result.append(self.indent('else:' + tail))
for z in node.orelse:
self.level += 1
result.append(self.visit(z))
self.level -= 1
return ''.join(result)
def do_Import(self, node):
head = self.leading_string(node)
tail = self.trailing_comment(node)
names = []
for fn, asname in self.get_import_names(node):
if asname:
names.append('%s as %s' % (fn, asname))
else:
names.append(fn)
s = 'pass # import %s' % ','.join(names)
return head + self.indent(s) + tail
def get_import_names(self, node):
'''Return a list of the the full file names in the import statement.'''
result = []
for ast2 in node.names:
assert isinstance(ast2, ast.alias)
data = ast2.name, ast2.asname
result.append(data)
return result
def do_ImportFrom(self, node):
head = self.leading_string(node)
tail = self.trailing_comment(node)
names = []
for fn, asname in self.get_import_names(node):
if asname:
names.append('%s as %s' % (fn, asname))
else:
names.append(fn)
s = 'pass # from %s import %s' % (node.module, ','.join(names))
return head + self.indent(s) + tail
# 3: Nonlocal(identifier* names)
def do_Nonlocal(self, node):
# https://www.python.org/dev/peps/pep-3104/
head = self.leading_string(node)
tail = self.trailing_comment(node)
names = ', '.join(node.names)
return head + self.indent('nonlocal') + names + tail
def do_Pass(self, node):
head = self.leading_string(node)
tail = self.trailing_comment(node)
return head + self.indent('pass') + tail
# Python 2.x only
def do_Print(self, node):
head = self.leading_string(node)
tail = self.trailing_comment(node)
vals = []
for z in node.values:
vals.append(self.visit(z))
if getattr(node, 'dest', None) is not None:
vals.append('dest=%s' % self.visit(node.dest))
if getattr(node, 'nl', None) is not None:
if node.nl == 'False':
vals.append('nl=%s' % node.nl)
s = 'print(%s)' % ','.join(vals)
return head + self.indent(s) + tail
def do_Raise(self, node):
head = self.leading_string(node)
tail = self.trailing_comment(node)
args = []
for attr in ('type', 'inst', 'tback'):
if getattr(node, attr, None) is not None:
args.append(self.visit(getattr(node, attr)))
s = 'raise %s' % ', '.join(args) if args else 'raise'
return head + self.indent(s) + tail
def do_Return(self, node):
head = self.leading_string(node)
tail = self.trailing_comment(node)
if node.value:
s = 'return %s' % self.visit(node.value).strip()
else:
s = 'return'
return head + self.indent(s) + tail
# Starred(expr value, expr_context ctx)
def do_Starred(self, node):
# https://www.python.org/dev/peps/pep-3132/
return '*' + self.visit(node.value)
# 3: Try(stmt* body, excepthandler* handlers, stmt* orelse, stmt* finalbody)
def do_Try(self, node): # Python 3
# https://www.python.org/dev/peps/pep-0341/
result = self.leading_lines(node)
tail = self.trailing_comment(node)
s = 'try' + tail
result.append(self.indent(s))
for z in node.body:
self.level += 1
result.append(self.visit(z))
self.level -= 1
if node.handlers:
for z in node.handlers:
result.append(self.visit(z))
if node.orelse:
tail = self.tail_after_body(node.body, node.orelse, result)
result.append(self.indent('else:' + tail))
for z in node.orelse:
self.level += 1
result.append(self.visit(z))
self.level -= 1
if node.finalbody:
tail = self.tail_after_body(node.body, node.finalbody, result)
s = 'finally:' + tail
result.append(self.indent(s))
for z in node.finalbody:
self.level += 1
result.append(self.visit(z))
self.level -= 1
return ''.join(result)
def do_TryExcept(self, node):
result = self.leading_lines(node)
tail = self.trailing_comment(node)
s = 'try:' + tail
result.append(self.indent(s))
for z in node.body:
self.level += 1
result.append(self.visit(z))
self.level -= 1
if node.handlers:
for z in node.handlers:
result.append(self.visit(z))
if node.orelse:
tail = self.trailing_comment(node.orelse)
s = 'else:' + tail
result.append(self.indent(s))
for z in node.orelse:
self.level += 1
result.append(self.visit(z))
self.level -= 1
return ''.join(result)
def do_TryFinally(self, node):
result = self.leading_lines(node)
tail = self.trailing_comment(node)
result.append(self.indent('try:' + tail))
for z in node.body:
self.level += 1
result.append(self.visit(z))
self.level -= 1
tail = self.tail_after_body(node.body, node.finalbody, result)
result.append(self.indent('finally:' + tail))
for z in node.finalbody:
self.level += 1
result.append(self.visit(z))
self.level -= 1
return ''.join(result)
def do_While(self, node):
result = self.leading_lines(node)
tail = self.trailing_comment(node)
s = 'while %s:' % self.visit(node.test)
result.append(self.indent(s + tail))
for z in node.body:
self.level += 1
result.append(self.visit(z))
self.level -= 1
if node.orelse:
tail = self.trailing_comment(node)
result.append(self.indent('else:' + tail))
for z in node.orelse:
self.level += 1
result.append(self.visit(z))
self.level -= 1
return ''.join(result)
# 2: With(expr context_expr, expr? optional_vars,
# stmt* body)
# 3: With(withitem* items,
# stmt* body)
# withitem = (expr context_expr, expr? optional_vars)
def do_With(self, node):
result = self.leading_lines(node)
tail = self.trailing_comment(node)
vars_list = []
result.append(self.indent('with '))
if getattr(node, 'context_expression', None):
result.append(self.visit(node.context_expresssion))
if getattr(node, 'optional_vars', None):
try:
for z in node.optional_vars:
vars_list.append(self.visit(z))
except TypeError: # Not iterable.
vars_list.append(self.visit(node.optional_vars))
if getattr(node, 'items', None): # Python 3.
for item in node.items:
result.append(self.visit(item.context_expr))
if getattr(item, 'optional_vars', None):
try:
for z in item.optional_vars:
vars_list.append(self.visit(z))
except TypeError: # Not iterable.
vars_list.append(self.visit(item.optional_vars))
result.append(','.join(vars_list))
result.append(':' + tail)
for z in node.body:
self.level += 1
result.append(self.visit(z))
self.level -= 1
return ''.join(result) + tail
def do_Yield(self, node):
head = self.leading_string(node)
tail = self.trailing_comment(node)
if getattr(node, 'value', None) is not None:
s = 'yield %s' % self.visit(node.value)
else:
s ='yield'
return head + self.indent(s) + tail
# 3: YieldFrom(expr value)
def do_YieldFrom(self, node):
# https://www.python.org/dev/peps/pep-0380/
head = self.leading_string(node)
tail = self.trailing_comment(node)
s = 'yield from %s' % self.visit(node.value)
return head + self.indent(s) + tail
class LeoGlobals(object):
'''A class supporting g.pdb and g.trace for compatibility with Leo.'''
class NullObject:
"""
An object that does nothing, and does it very well.
From the Python cookbook, recipe 5.23
"""
def __init__(self, *args, **keys): pass
def __call__(self, *args, **keys): return self
def __repr__(self): return "NullObject"
def __str__(self): return "NullObject"
def __bool__(self): return False
def __nonzero__(self): return 0
def __delattr__(self, attr): return self
def __getattr__(self, attr): return self
def __setattr__(self, attr, val): return self
class ReadLinesClass:
"""A class whose next method provides a readline method for Python's tokenize module."""
def __init__(self, s):
self.lines = s.splitlines(True) if s else []
# g.splitLines(s)
self.i = 0
def next(self):
if self.i < len(self.lines):
line = self.lines[self.i]
self.i += 1
else:
line = ''
# g.trace(repr(line))
return line
__next__ = next
def _callerName(self, n=1, files=False):
# print('_callerName: %s %s' % (n,files))
try: # get the function name from the call stack.
f1 = sys._getframe(n) # The stack frame, n levels up.
code1 = f1.f_code # The code object
name = code1.co_name
if name == '__init__':
name = '__init__(%s,line %s)' % (
self.shortFileName(code1.co_filename), code1.co_firstlineno)
if files: