pythonVSCode/pythonFiles/parso/python/tokenize.py at master · neviim/pythonVSCode · GitHub

History

609 lines (522 loc) · 22.2 KB

Raw

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

# -*- coding: utf-8 -*-

"""

This tokenizer has been copied from the ``tokenize.py`` standard library

tokenizer. The reason was simple: The standard library tokenizer fails

if the indentation is not right. To make it possible to do error recovery the

tokenizer needed to be rewritten.

Basically this is a stripped down version of the standard library module, so

you can read the documentation there. Additionally we included some speed and

memory optimizations here.

"""

from __future__ import absolute_import

import sys

import string

import re

from collections import namedtuple

import itertools as _itertools

from codecs import BOM_UTF8

from parso.python.token import (tok_name, ENDMARKER, STRING, NUMBER, opmap,

NAME, ERRORTOKEN, NEWLINE, INDENT, DEDENT,

ERROR_DEDENT, FSTRING_STRING, FSTRING_START,

FSTRING_END)

from parso._compatibility import py_version

from parso.utils import split_lines

TokenCollection = namedtuple(

'TokenCollection',

'pseudo_token single_quoted triple_quoted endpats whitespace '

'fstring_pattern_map always_break_tokens',

)

BOM_UTF8_STRING = BOM_UTF8.decode('utf-8')

_token_collection_cache = {}

if py_version >= 30:

# Python 3 has str.isidentifier() to check if a char is a valid identifier

is_identifier = str.isidentifier

else:

namechars = string.ascii_letters + '_'

is_identifier = lambda s: s in namechars

def group(*choices, **kwargs):

capture = kwargs.pop('capture', False) # Python 2, arrghhhhh :(

assert not kwargs

start = '('

if not capture:

start += '?:'

return start + '|'.join(choices) + ')'

def maybe(*choices):

return group(*choices) + '?'

# Return the empty string, plus all of the valid string prefixes.

def _all_string_prefixes(version_info, include_fstring=False, only_fstring=False):

def different_case_versions(prefix):

for s in _itertools.product(*[(c, c.upper()) for c in prefix]):

yield ''.join(s)

# The valid string prefixes. Only contain the lower case versions,

# and don't contain any permuations (include 'fr', but not

# 'rf'). The various permutations will be generated.

valid_string_prefixes = ['b', 'r', 'u']

if version_info >= (3, 0):

valid_string_prefixes.append('br')

result = set([''])

if version_info >= (3, 6) and include_fstring:

f = ['f', 'fr']

if only_fstring:

valid_string_prefixes = f

result = set()

else:

valid_string_prefixes += f

elif only_fstring:

return set()

# if we add binary f-strings, add: ['fb', 'fbr']

for prefix in valid_string_prefixes:

for t in _itertools.permutations(prefix):

# create a list with upper and lower versions of each

# character

result.update(different_case_versions(t))

if version_info <= (2, 7):

# In Python 2 the order cannot just be random.

result.update(different_case_versions('ur'))

result.update(different_case_versions('br'))

return result

def _compile(expr):

return re.compile(expr, re.UNICODE)

def _get_token_collection(version_info):

try:

return _token_collection_cache[tuple(version_info)]

except KeyError:

_token_collection_cache[tuple(version_info)] = result = \

_create_token_collection(version_info)

return result

fstring_string_single_line = _compile(r'(?:[^{}\r\n]+|\{\{|\}\})+')

fstring_string_multi_line = _compile(r'(?:[^{}]+|\{\{|\}\})+')

def _create_token_collection(version_info):

# Note: we use unicode matching for names ("\w") but ascii matching for

# number literals.

Whitespace = r'[ \f\t]*'

whitespace = _compile(Whitespace)

Comment = r'#[^\r\n]*'

Name = r'\w+'

if version_info >= (3, 6):

Hexnumber = r'0[xX](?:_?[0-9a-fA-F])+'

Binnumber = r'0[bB](?:_?[01])+'

Octnumber = r'0[oO](?:_?[0-7])+'

Decnumber = r'(?:0(?:_?0)*|[1-9](?:_?[0-9])*)'

Intnumber = group(Hexnumber, Binnumber, Octnumber, Decnumber)

Exponent = r'[eE][-+]?[0-9](?:_?[0-9])*'

Pointfloat = group(r'[0-9](?:_?[0-9])*\.(?:[0-9](?:_?[0-9])*)?',

r'\.[0-9](?:_?[0-9])*') + maybe(Exponent)

Expfloat = r'[0-9](?:_?[0-9])*' + Exponent

Floatnumber = group(Pointfloat, Expfloat)

Imagnumber = group(r'[0-9](?:_?[0-9])*[jJ]', Floatnumber + r'[jJ]')

else:

Hexnumber = r'0[xX][0-9a-fA-F]+'

Binnumber = r'0[bB][01]+'

if version_info >= (3, 0):

Octnumber = r'0[oO][0-7]+'

else:

Octnumber = '0[oO]?[0-7]+'

Decnumber = r'(?:0+|[1-9][0-9]*)'

Intnumber = group(Hexnumber, Binnumber, Octnumber, Decnumber)

Exponent = r'[eE][-+]?[0-9]+'

Pointfloat = group(r'[0-9]+\.[0-9]*', r'\.[0-9]+') + maybe(Exponent)

Expfloat = r'[0-9]+' + Exponent

Floatnumber = group(Pointfloat, Expfloat)

Imagnumber = group(r'[0-9]+[jJ]', Floatnumber + r'[jJ]')

Number = group(Imagnumber, Floatnumber, Intnumber)

# Note that since _all_string_prefixes includes the empty string,

# StringPrefix can be the empty string (making it optional).

possible_prefixes = _all_string_prefixes(version_info)

StringPrefix = group(*possible_prefixes)

StringPrefixWithF = group(*_all_string_prefixes(version_info, include_fstring=True))

fstring_prefixes = _all_string_prefixes(version_info, include_fstring=True, only_fstring=True)

FStringStart = group(*fstring_prefixes)

# Tail end of ' string.

Single = r"[^'\\]*(?:\\.[^'\\]*)*'"

# Tail end of " string.

Double = r'[^"\\]*(?:\\.[^"\\]*)*"'

# Tail end of ''' string.

Single3 = r"[^'\\]*(?:(?:\\.|'(?!''))[^'\\]*)*'''"

# Tail end of """ string.

Double3 = r'[^"\\]*(?:(?:\\.|"(?!""))[^"\\]*)*"""'

Triple = group(StringPrefixWithF + "'''", StringPrefixWithF + '"""')

# Because of leftmost-then-longest match semantics, be sure to put the

# longest operators first (e.g., if = came before ==, == would get

# recognized as two instances of =).

Operator = group(r"\*\*=?", r">>=?", r"<<=?",

r"//=?", r"->",

r"[+\-*/%&@`|^!=<>]=?",

r"~")

Bracket = '[][(){}]'

special_args = [r'\r?\n', r'[:;.,@]']

if version_info >= (3, 0):

special_args.insert(0, r'\.\.\.')

Special = group(*special_args)

Funny = group(Operator, Bracket, Special)

# First (or only) line of ' or " string.

ContStr = group(StringPrefix + r"'[^\n'\\]*(?:\\.[^\n'\\]*)*" +

group("'", r'\\\r?\n'),

StringPrefix + r'"[^\n"\\]*(?:\\.[^\n"\\]*)*' +

group('"', r'\\\r?\n'))

pseudo_extra_pool = [Comment, Triple]

all_quotes = '"', "'", '"""', "'''"

if fstring_prefixes:

pseudo_extra_pool.append(FStringStart + group(*all_quotes))

PseudoExtras = group(r'\\\r?\n|\Z', *pseudo_extra_pool)

PseudoToken = group(Whitespace, capture=True) + \

group(PseudoExtras, Number, Funny, ContStr, Name, capture=True)

# For a given string prefix plus quotes, endpats maps it to a regex

# to match the remainder of that string. _prefix can be empty, for

# a normal single or triple quoted string (with no prefix).

endpats = {}

for _prefix in possible_prefixes:

endpats[_prefix + "'"] = _compile(Single)

endpats[_prefix + '"'] = _compile(Double)

endpats[_prefix + "'''"] = _compile(Single3)

endpats[_prefix + '"""'] = _compile(Double3)

# A set of all of the single and triple quoted string prefixes,

# including the opening quotes.

single_quoted = set()

triple_quoted = set()

fstring_pattern_map = {}

for t in possible_prefixes:

for quote in '"', "'":

single_quoted.add(t + quote)

for quote in '"""', "'''":

triple_quoted.add(t + quote)

for t in fstring_prefixes:

for quote in all_quotes:

fstring_pattern_map[t + quote] = quote

ALWAYS_BREAK_TOKENS = (';', 'import', 'class', 'def', 'try', 'except',

'finally', 'while', 'with', 'return')

pseudo_token_compiled = _compile(PseudoToken)

return TokenCollection(

pseudo_token_compiled, single_quoted, triple_quoted, endpats,

whitespace, fstring_pattern_map, ALWAYS_BREAK_TOKENS

)

class Token(namedtuple('Token', ['type', 'string', 'start_pos', 'prefix'])):

@property

def end_pos(self):

lines = split_lines(self.string)

if len(lines) > 1:

return self.start_pos[0] + len(lines) - 1, 0

else:

return self.start_pos[0], self.start_pos[1] + len(self.string)

class PythonToken(Token):

def _get_type_name(self, exact=True):

return tok_name[self.type]

def __repr__(self):

return ('TokenInfo(type=%s, string=%r, start_pos=%r, prefix=%r)' %

self._replace(type=self._get_type_name()))

class FStringNode(object):

def __init__(self, quote):

self.quote = quote

self.parentheses_count = 0

self.previous_lines = ''

self.last_string_start_pos = None

# In the syntax there can be multiple format_spec's nested:

# {x:{y:3}}

self.format_spec_count = 0

def open_parentheses(self, character):

self.parentheses_count += 1

def close_parentheses(self, character):

self.parentheses_count -= 1

def allow_multiline(self):

return len(self.quote) == 3

def is_in_expr(self):

return (self.parentheses_count - self.format_spec_count) > 0

def _check_fstring_ending(fstring_stack, token, from_start=False):

fstring_end = float('inf')

fstring_index = None

for i, node in enumerate(fstring_stack):

if from_start:

if token.startswith(node.quote):

fstring_index = i

fstring_end = len(node.quote)

else:

continue

else:

try:

end = token.index(node.quote)

except ValueError:

pass

else:

if fstring_index is None or end < fstring_end:

fstring_index = i

fstring_end = end

return fstring_index, fstring_end

def _find_fstring_string(fstring_stack, line, lnum, pos):

tos = fstring_stack[-1]

if tos.is_in_expr():

return '', pos

else:

new_pos = pos

allow_multiline = tos.allow_multiline()

if allow_multiline:

match = fstring_string_multi_line.match(line, pos)

else:

match = fstring_string_single_line.match(line, pos)

if match is None:

string = tos.previous_lines

else:

if not tos.previous_lines:

tos.last_string_start_pos = (lnum, pos)

string = match.group(0)

for fstring_stack_node in fstring_stack:

try:

string = string[:string.index(fstring_stack_node.quote)]

except ValueError:

pass # The string was not found.

new_pos += len(string)

if allow_multiline and string.endswith('\n'):

tos.previous_lines += string

string = ''

else:

string = tos.previous_lines + string

return string, new_pos

def tokenize(code, version_info, start_pos=(1, 0)):

"""Generate tokens from a the source code (string)."""

lines = split_lines(code, keepends=True)

return tokenize_lines(lines, version_info, start_pos=start_pos)

def _print_tokens(func):

"""

A small helper function to help debug the tokenize_lines function.

"""

def wrapper(*args, **kwargs):

for token in func(*args, **kwargs):

print(token)

yield token

return wrapper

# @_print_tokens

def tokenize_lines(lines, version_info, start_pos=(1, 0)):

"""

A heavily modified Python standard library tokenizer.

Additionally to the default information, yields also the prefix of each

token. This idea comes from lib2to3. The prefix contains all information

that is irrelevant for the parser like newlines in parentheses or comments.

"""

pseudo_token, single_quoted, triple_quoted, endpats, whitespace, \

fstring_pattern_map, always_break_tokens, = \

_get_token_collection(version_info)

paren_level = 0 # count parentheses

indents = [0]

max = 0

numchars = '0123456789'

contstr = ''

contline = None

# We start with a newline. This makes indent at the first position

# possible. It's not valid Python, but still better than an INDENT in the

# second line (and not in the first). This makes quite a few things in

# Jedi's fast parser possible.

new_line = True

prefix = '' # Should never be required, but here for safety

additional_prefix = ''

first = True

lnum = start_pos[0] - 1

fstring_stack = []

for line in lines: # loop over lines in stream

lnum += 1

pos = 0

max = len(line)

if first:

if line.startswith(BOM_UTF8_STRING):

additional_prefix = BOM_UTF8_STRING

line = line[1:]

max = len(line)

# Fake that the part before was already parsed.

line = '^' * start_pos[1] + line

pos = start_pos[1]

max += start_pos[1]

first = False

if contstr: # continued string

endmatch = endprog.match(line)

if endmatch:

pos = endmatch.end(0)

yield PythonToken(STRING, contstr + line[:pos], contstr_start, prefix)

contstr = ''

contline = None

else:

contstr = contstr + line

contline = contline + line

continue

while pos < max:

if fstring_stack:

string, pos = _find_fstring_string(fstring_stack, line, lnum, pos)

if string:

yield PythonToken(

FSTRING_STRING, string,

fstring_stack[-1].last_string_start_pos,

# Never has a prefix because it can start anywhere and

# include whitespace.

prefix=''

)

fstring_stack[-1].previous_lines = ''

continue

if pos == max:

break

rest = line[pos:]

fstring_index, end = _check_fstring_ending(fstring_stack, rest, from_start=True)

if fstring_index is not None:

yield PythonToken(

FSTRING_END,

fstring_stack[fstring_index].quote,

(lnum, pos),

prefix=additional_prefix,

)

additional_prefix = ''

del fstring_stack[fstring_index:]

pos += end

continue

pseudomatch = pseudo_token.match(line, pos)

if not pseudomatch: # scan for tokens

if line.endswith('\n'):

new_line = True

match = whitespace.match(line, pos)

pos = match.end()

yield PythonToken(

ERRORTOKEN, line[pos:], (lnum, pos),

additional_prefix + match.group(0)

)

additional_prefix = ''

break

prefix = additional_prefix + pseudomatch.group(1)

additional_prefix = ''

start, pos = pseudomatch.span(2)

spos = (lnum, start)

token = pseudomatch.group(2)

if token == '':

assert prefix

additional_prefix = prefix

# This means that we have a line with whitespace/comments at

# the end, which just results in an endmarker.

break

initial = token[0]

if new_line and initial not in '\r\n#':

new_line = False

if paren_level == 0 and not fstring_stack:

i = 0

while line[i] == '\f':

i += 1

# TODO don't we need to change spos as well?

start -= 1

if start > indents[-1]:

yield PythonToken(INDENT, '', spos, '')

indents.append(start)

while start < indents[-1]:

if start > indents[-2]:

yield PythonToken(ERROR_DEDENT, '', (lnum, 0), '')

break

yield PythonToken(DEDENT, '', spos, '')

indents.pop()

if fstring_stack:

fstring_index, end = _check_fstring_ending(fstring_stack, token)

if fstring_index is not None:

if end != 0:

yield PythonToken(ERRORTOKEN, token[:end], spos, prefix)

prefix = ''

yield PythonToken(

FSTRING_END,

fstring_stack[fstring_index].quote,

(lnum, spos[1] + 1),

prefix=prefix

)

del fstring_stack[fstring_index:]

pos -= len(token) - end

continue

if (initial in numchars or # ordinary number

(initial == '.' and token != '.' and token != '...')):

yield PythonToken(NUMBER, token, spos, prefix)

elif initial in '\r\n':

if any(not f.allow_multiline() for f in fstring_stack):

# Would use fstring_stack.clear, but that's not available

# in Python 2.

fstring_stack[:] = []

if not new_line and paren_level == 0 and not fstring_stack:

yield PythonToken(NEWLINE, token, spos, prefix)

else:

additional_prefix = prefix + token

new_line = True

elif initial == '#': # Comments

assert not token.endswith("\n")

additional_prefix = prefix + token

elif token in triple_quoted:

endprog = endpats[token]

endmatch = endprog.match(line, pos)

if endmatch: # all on one line

pos = endmatch.end(0)

token = line[start:pos]

yield PythonToken(STRING, token, spos, prefix)

else:

contstr_start = (lnum, start) # multiple lines

contstr = line[start:]

contline = line

break

elif initial in single_quoted or \

token[:2] in single_quoted or \

token[:3] in single_quoted:

if token[-1] == '\n': # continued string

contstr_start = lnum, start

endprog = (endpats.get(initial) or endpats.get(token[1])

or endpats.get(token[2]))

contstr = line[start:]

contline = line

break

else: # ordinary string

yield PythonToken(STRING, token, spos, prefix)

elif token in fstring_pattern_map: # The start of an fstring.

fstring_stack.append(FStringNode(fstring_pattern_map[token]))

yield PythonToken(FSTRING_START, token, spos, prefix)

elif is_identifier(initial): # ordinary name

if token in always_break_tokens:

fstring_stack[:] = []

paren_level = 0

while True:

indent = indents.pop()

if indent > start:

yield PythonToken(DEDENT, '', spos, '')

else:

indents.append(indent)

break

yield PythonToken(NAME, token, spos, prefix)

elif initial == '\\' and line[start:] in ('\\\n', '\\\r\n'): # continued stmt

additional_prefix += prefix + line[start:]

break

else:

if token in '([{':

if fstring_stack:

fstring_stack[-1].open_parentheses(token)

else:

paren_level += 1

elif token in ')]}':

if fstring_stack:

fstring_stack[-1].close_parentheses(token)

else:

paren_level -= 1

elif token == ':' and fstring_stack \

and fstring_stack[-1].parentheses_count == 1:

fstring_stack[-1].format_spec_count += 1

try:

# This check is needed in any case to check if it's a valid

# operator or just some random unicode character.

typ = opmap[token]

except KeyError:

typ = ERRORTOKEN

yield PythonToken(typ, token, spos, prefix)

if contstr:

yield PythonToken(ERRORTOKEN, contstr, contstr_start, prefix)

if contstr.endswith('\n'):

new_line = True

end_pos = lnum, max

# As the last position we just take the maximally possible position. We

# remove -1 for the last new line.

for indent in indents[1:]:

yield PythonToken(DEDENT, '', end_pos, '')

yield PythonToken(ENDMARKER, '', end_pos, additional_prefix)

if __name__ == "__main__":

if len(sys.argv) >= 2:

path = sys.argv[1]

with open(path) as f:

code = f.read()

else:

code = sys.stdin.read()

from parso.utils import python_bytes_to_unicode, parse_version_string

if isinstance(code, bytes):

code = python_bytes_to_unicode(code)

for token in tokenize(code, parse_version_string()):

print(token)

pythonVSCode/pythonFiles/parso/python/tokenize.py at master · neviim/pythonVSCode · GitHub

Expand file tree

Breadcrumbs

tokenize.py

Latest commit

History

Breadcrumbs

tokenize.py

File metadata and controls