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
|
from __future__ import annotations
import argparse
import io
import keyword
import re
import sys
import tokenize
from collections.abc import Generator
from collections.abc import Iterable
from collections.abc import Sequence
from re import Pattern
from typing import NamedTuple
# this is a performance hack. see https://bugs.python.org/issue43014
if ( # pragma: no branch
sys.version_info < (3, 10) and
callable(getattr(tokenize, '_compile', None))
): # pragma: <3.10 cover
from functools import lru_cache
tokenize._compile = lru_cache(tokenize._compile)
ESCAPED_NL = 'ESCAPED_NL'
UNIMPORTANT_WS = 'UNIMPORTANT_WS'
NON_CODING_TOKENS = frozenset(('COMMENT', ESCAPED_NL, 'NL', UNIMPORTANT_WS))
class Offset(NamedTuple):
line: int | None = None
utf8_byte_offset: int | None = None
class Token(NamedTuple):
name: str
src: str
line: int | None = None
utf8_byte_offset: int | None = None
@property
def offset(self) -> Offset:
return Offset(self.line, self.utf8_byte_offset)
def matches(self, *, name: str, src: str) -> bool:
return self.name == name and self.src == src
_string_re = re.compile('^([^\'"]*)(.*)$', re.DOTALL)
_escaped_nl_re = re.compile(r'\\(\n|\r\n|\r)')
NAMED_UNICODE_RE = re.compile(r'(?<!\\)(?:\\\\)*(\\N\{[^}]+\})')
def curly_escape(s: str) -> str:
parts = NAMED_UNICODE_RE.split(s)
return ''.join(
part.replace('{', '{{').replace('}', '}}') if i % 2 == 0 else part
for i, part in enumerate(parts)
)
def _re_partition(regex: Pattern[str], s: str) -> tuple[str, str, str]:
match = regex.search(s)
if match:
return s[:match.start()], s[slice(*match.span())], s[match.end():]
else:
return (s, '', '')
def src_to_tokens(src: str) -> list[Token]:
tokenize_target = io.StringIO(src)
lines = ('',) + tuple(tokenize_target)
tokenize_target.seek(0)
tokens = []
last_line = 1
last_col = 0
end_offset = 0
gen = tokenize.generate_tokens(tokenize_target.readline)
for tok_type, tok_text, (sline, scol), (eline, ecol), line in gen:
if sline > last_line:
newtok = lines[last_line][last_col:]
for lineno in range(last_line + 1, sline):
newtok += lines[lineno]
if scol > 0:
newtok += lines[sline][:scol]
# a multiline unimportant whitespace may contain escaped newlines
while _escaped_nl_re.search(newtok):
ws, nl, newtok = _re_partition(_escaped_nl_re, newtok)
if ws:
tokens.append(
Token(UNIMPORTANT_WS, ws, last_line, end_offset),
)
end_offset += len(ws.encode())
tokens.append(Token(ESCAPED_NL, nl, last_line, end_offset))
end_offset = 0
last_line += 1
if newtok:
tokens.append(Token(UNIMPORTANT_WS, newtok, sline, 0))
end_offset = len(newtok.encode())
else:
end_offset = 0
elif scol > last_col:
newtok = line[last_col:scol]
tokens.append(Token(UNIMPORTANT_WS, newtok, sline, end_offset))
end_offset += len(newtok.encode())
tok_name = tokenize.tok_name[tok_type]
if tok_name == 'FSTRING_MIDDLE': # pragma: >=3.12 cover
if '{' in tok_text or '}' in tok_text:
new_tok_text = curly_escape(tok_text)
ecol += len(new_tok_text) - len(tok_text)
tok_text = new_tok_text
tokens.append(Token(tok_name, tok_text, sline, end_offset))
last_line, last_col = eline, ecol
if sline != eline:
end_offset = len(lines[last_line][:last_col].encode())
else:
end_offset += len(tok_text.encode())
return tokens
def tokens_to_src(tokens: Iterable[Token]) -> str:
return ''.join(tok.src for tok in tokens)
def reversed_enumerate(
tokens: Sequence[Token],
) -> Generator[tuple[int, Token]]:
for i in reversed(range(len(tokens))):
yield i, tokens[i]
def parse_string_literal(src: str) -> tuple[str, str]:
"""parse a string literal's source into (prefix, string)"""
match = _string_re.match(src)
assert match is not None
return match.group(1), match.group(2)
def rfind_string_parts(tokens: Sequence[Token], i: int) -> tuple[int, ...]:
"""find the indicies of the string parts of a (joined) string literal
- `i` should start at the end of the string literal
- returns `()` (an empty tuple) for things which are not string literals
"""
ret = []
depth = 0
for i in range(i, -1, -1):
token = tokens[i]
if token.name == 'STRING':
ret.append(i)
elif token.name in NON_CODING_TOKENS:
pass
elif token.src == ')':
depth += 1
elif depth and token.src == '(':
depth -= 1
# if we closed the paren(s) make sure it was a parenthesized string
# and not actually a call
if depth == 0:
for j in range(i - 1, -1, -1):
tok = tokens[j]
if tok.name in NON_CODING_TOKENS:
pass
# this was actually a call and not a parenthesized string
elif (
tok.src in {']', ')'} or (
tok.name == 'NAME' and
tok.src not in keyword.kwlist
)
):
return ()
else:
break
break
elif depth: # it looked like a string but wasn't
return ()
else:
break
return tuple(reversed(ret))
def main(argv: Sequence[str] | None = None) -> int:
parser = argparse.ArgumentParser()
parser.add_argument('filename')
args = parser.parse_args(argv)
with open(args.filename) as f:
tokens = src_to_tokens(f.read())
for token in tokens:
line, col = str(token.line), str(token.utf8_byte_offset)
print(f'{line}:{col} {token.name} {token.src!r}')
return 0
if __name__ == '__main__':
raise SystemExit(main())
|
