2010-06-01 20:18:57 +04:00
|
|
|
# parser.py - simple top-down operator precedence parser for mercurial
|
|
|
|
#
|
|
|
|
# Copyright 2010 Matt Mackall <mpm@selenic.com>
|
|
|
|
#
|
|
|
|
# This software may be used and distributed according to the terms of the
|
|
|
|
# GNU General Public License version 2 or any later version.
|
|
|
|
|
2010-06-11 15:35:38 +04:00
|
|
|
# see http://effbot.org/zone/simple-top-down-parsing.htm and
|
2010-06-01 20:18:57 +04:00
|
|
|
# http://eli.thegreenplace.net/2010/01/02/top-down-operator-precedence-parsing/
|
|
|
|
# for background
|
|
|
|
|
|
|
|
# takes a tokenizer and elements
|
2015-06-20 18:56:09 +03:00
|
|
|
# tokenizer is an iterator that returns (type, value, pos) tuples
|
parser: separate actions for primary expression and prefix operator
This will allow us to define both a primary expression, ":", and a prefix
operator, ":y". The ambiguity will be resolved by the next patch.
Prefix actions in elements table are adjusted as follows:
original prefix primary prefix
----------------- -------- -----------------
("group", 1, ")") -> n/a ("group", 1, ")")
("negate", 19) -> n/a ("negate", 19)
("symbol",) -> "symbol" n/a
2015-07-05 06:02:13 +03:00
|
|
|
# elements is a mapping of types to binding strength, primary, prefix, infix
|
|
|
|
# and suffix actions
|
2010-06-01 20:18:57 +04:00
|
|
|
# an action is a tree node name, a tree label, and an optional match
|
2012-08-18 00:58:18 +04:00
|
|
|
# __call__(program) parses program into a labeled tree
|
2010-06-01 20:18:57 +04:00
|
|
|
|
2017-09-03 08:56:31 +03:00
|
|
|
from __future__ import absolute_import, print_function
|
2015-08-09 05:44:05 +03:00
|
|
|
|
|
|
|
from .i18n import _
|
2017-03-17 17:42:46 +03:00
|
|
|
from . import (
|
2017-09-03 15:17:25 +03:00
|
|
|
encoding,
|
2017-03-17 17:42:46 +03:00
|
|
|
error,
|
|
|
|
util,
|
|
|
|
)
|
2010-06-05 05:57:52 +04:00
|
|
|
|
2010-06-01 20:18:57 +04:00
|
|
|
class parser(object):
|
2015-06-20 18:49:26 +03:00
|
|
|
def __init__(self, elements, methods=None):
|
2010-06-01 20:18:57 +04:00
|
|
|
self._elements = elements
|
|
|
|
self._methods = methods
|
2010-12-20 21:09:00 +03:00
|
|
|
self.current = None
|
2010-06-01 20:18:57 +04:00
|
|
|
def _advance(self):
|
|
|
|
'advance the tokenizer'
|
|
|
|
t = self.current
|
2015-05-18 20:27:15 +03:00
|
|
|
self.current = next(self._iter, None)
|
2010-06-01 20:18:57 +04:00
|
|
|
return t
|
2015-07-05 05:54:14 +03:00
|
|
|
def _hasnewterm(self):
|
|
|
|
'True if next token may start new term'
|
parser: separate actions for primary expression and prefix operator
This will allow us to define both a primary expression, ":", and a prefix
operator, ":y". The ambiguity will be resolved by the next patch.
Prefix actions in elements table are adjusted as follows:
original prefix primary prefix
----------------- -------- -----------------
("group", 1, ")") -> n/a ("group", 1, ")")
("negate", 19) -> n/a ("negate", 19)
("symbol",) -> "symbol" n/a
2015-07-05 06:02:13 +03:00
|
|
|
return any(self._elements[self.current[0]][1:3])
|
2015-07-05 11:50:35 +03:00
|
|
|
def _match(self, m):
|
2010-06-01 20:18:57 +04:00
|
|
|
'make sure the tokenizer matches an end condition'
|
|
|
|
if self.current[0] != m:
|
2011-06-21 02:17:52 +04:00
|
|
|
raise error.ParseError(_("unexpected token: %s") % self.current[0],
|
2010-06-08 11:30:45 +04:00
|
|
|
self.current[2])
|
2010-06-01 20:18:57 +04:00
|
|
|
self._advance()
|
2015-07-05 12:09:15 +03:00
|
|
|
def _parseoperand(self, bind, m=None):
|
|
|
|
'gather right-hand-side operand until an end condition or binding met'
|
|
|
|
if m and self.current[0] == m:
|
|
|
|
expr = None
|
|
|
|
else:
|
|
|
|
expr = self._parse(bind)
|
|
|
|
if m:
|
|
|
|
self._match(m)
|
|
|
|
return expr
|
2010-06-01 20:18:57 +04:00
|
|
|
def _parse(self, bind=0):
|
2010-06-05 05:57:52 +04:00
|
|
|
token, value, pos = self._advance()
|
2015-07-05 06:09:27 +03:00
|
|
|
# handle prefix rules on current token, take as primary if unambiguous
|
parser: separate actions for primary expression and prefix operator
This will allow us to define both a primary expression, ":", and a prefix
operator, ":y". The ambiguity will be resolved by the next patch.
Prefix actions in elements table are adjusted as follows:
original prefix primary prefix
----------------- -------- -----------------
("group", 1, ")") -> n/a ("group", 1, ")")
("negate", 19) -> n/a ("negate", 19)
("symbol",) -> "symbol" n/a
2015-07-05 06:02:13 +03:00
|
|
|
primary, prefix = self._elements[token][1:3]
|
2015-07-05 06:09:27 +03:00
|
|
|
if primary and not (prefix and self._hasnewterm()):
|
parser: separate actions for primary expression and prefix operator
This will allow us to define both a primary expression, ":", and a prefix
operator, ":y". The ambiguity will be resolved by the next patch.
Prefix actions in elements table are adjusted as follows:
original prefix primary prefix
----------------- -------- -----------------
("group", 1, ")") -> n/a ("group", 1, ")")
("negate", 19) -> n/a ("negate", 19)
("symbol",) -> "symbol" n/a
2015-07-05 06:02:13 +03:00
|
|
|
expr = (primary, value)
|
|
|
|
elif prefix:
|
2015-07-05 12:09:15 +03:00
|
|
|
expr = (prefix[0], self._parseoperand(*prefix[1:]))
|
parser: separate actions for primary expression and prefix operator
This will allow us to define both a primary expression, ":", and a prefix
operator, ":y". The ambiguity will be resolved by the next patch.
Prefix actions in elements table are adjusted as follows:
original prefix primary prefix
----------------- -------- -----------------
("group", 1, ")") -> n/a ("group", 1, ")")
("negate", 19) -> n/a ("negate", 19)
("symbol",) -> "symbol" n/a
2015-07-05 06:02:13 +03:00
|
|
|
else:
|
|
|
|
raise error.ParseError(_("not a prefix: %s") % token, pos)
|
2010-06-01 20:18:57 +04:00
|
|
|
# gather tokens until we meet a lower binding strength
|
|
|
|
while bind < self._elements[self.current[0]][0]:
|
2010-06-05 05:57:52 +04:00
|
|
|
token, value, pos = self._advance()
|
2015-07-06 15:55:55 +03:00
|
|
|
# handle infix rules, take as suffix if unambiguous
|
parser: separate actions for primary expression and prefix operator
This will allow us to define both a primary expression, ":", and a prefix
operator, ":y". The ambiguity will be resolved by the next patch.
Prefix actions in elements table are adjusted as follows:
original prefix primary prefix
----------------- -------- -----------------
("group", 1, ")") -> n/a ("group", 1, ")")
("negate", 19) -> n/a ("negate", 19)
("symbol",) -> "symbol" n/a
2015-07-05 06:02:13 +03:00
|
|
|
infix, suffix = self._elements[token][3:]
|
2015-07-06 16:01:41 +03:00
|
|
|
if suffix and not (infix and self._hasnewterm()):
|
2015-07-05 15:11:19 +03:00
|
|
|
expr = (suffix, expr)
|
2015-07-06 15:55:55 +03:00
|
|
|
elif infix:
|
2015-07-05 12:09:15 +03:00
|
|
|
expr = (infix[0], expr, self._parseoperand(*infix[1:]))
|
2015-07-06 15:55:55 +03:00
|
|
|
else:
|
|
|
|
raise error.ParseError(_("not an infix: %s") % token, pos)
|
2010-06-01 20:18:57 +04:00
|
|
|
return expr
|
2015-06-20 18:49:26 +03:00
|
|
|
def parse(self, tokeniter):
|
|
|
|
'generate a parse tree from tokens'
|
|
|
|
self._iter = tokeniter
|
2010-12-20 21:09:00 +03:00
|
|
|
self._advance()
|
2011-03-17 01:09:14 +03:00
|
|
|
res = self._parse()
|
|
|
|
token, value, pos = self.current
|
|
|
|
return res, pos
|
2010-06-01 20:18:57 +04:00
|
|
|
def eval(self, tree):
|
|
|
|
'recursively evaluate a parse tree using node methods'
|
|
|
|
if not isinstance(tree, tuple):
|
|
|
|
return tree
|
|
|
|
return self._methods[tree[0]](*[self.eval(t) for t in tree[1:]])
|
2015-06-20 18:49:26 +03:00
|
|
|
def __call__(self, tokeniter):
|
|
|
|
'parse tokens into a parse tree and evaluate if methods given'
|
|
|
|
t = self.parse(tokeniter)
|
2010-06-01 20:18:57 +04:00
|
|
|
if self._methods:
|
|
|
|
return self.eval(t)
|
|
|
|
return t
|
2015-04-26 16:20:03 +03:00
|
|
|
|
2017-01-09 09:25:52 +03:00
|
|
|
def splitargspec(spec):
|
2017-04-03 16:07:09 +03:00
|
|
|
"""Parse spec of function arguments into (poskeys, varkey, keys, optkey)
|
2017-01-09 09:25:52 +03:00
|
|
|
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> splitargspec(b'')
|
2017-04-03 16:07:09 +03:00
|
|
|
([], None, [], None)
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> splitargspec(b'foo bar')
|
2017-04-03 16:07:09 +03:00
|
|
|
([], None, ['foo', 'bar'], None)
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> splitargspec(b'foo *bar baz **qux')
|
2017-04-03 16:07:09 +03:00
|
|
|
(['foo'], 'bar', ['baz'], 'qux')
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> splitargspec(b'*foo')
|
2017-04-03 16:07:09 +03:00
|
|
|
([], 'foo', [], None)
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> splitargspec(b'**foo')
|
2017-04-03 16:07:09 +03:00
|
|
|
([], None, [], 'foo')
|
2017-01-09 09:25:52 +03:00
|
|
|
"""
|
2017-04-03 16:07:09 +03:00
|
|
|
optkey = None
|
|
|
|
pre, sep, post = spec.partition('**')
|
|
|
|
if sep:
|
|
|
|
posts = post.split()
|
|
|
|
if not posts:
|
|
|
|
raise error.ProgrammingError('no **optkey name provided')
|
|
|
|
if len(posts) > 1:
|
|
|
|
raise error.ProgrammingError('excessive **optkey names provided')
|
|
|
|
optkey = posts[0]
|
|
|
|
|
|
|
|
pre, sep, post = pre.partition('*')
|
2017-01-09 09:25:52 +03:00
|
|
|
pres = pre.split()
|
|
|
|
posts = post.split()
|
|
|
|
if sep:
|
|
|
|
if not posts:
|
|
|
|
raise error.ProgrammingError('no *varkey name provided')
|
2017-04-03 16:07:09 +03:00
|
|
|
return pres, posts[0], posts[1:], optkey
|
|
|
|
return [], None, pres, optkey
|
2017-01-09 09:25:52 +03:00
|
|
|
|
|
|
|
def buildargsdict(trees, funcname, argspec, keyvaluenode, keynode):
|
2015-06-27 11:25:01 +03:00
|
|
|
"""Build dict from list containing positional and keyword arguments
|
|
|
|
|
2017-04-03 16:07:09 +03:00
|
|
|
Arguments are specified by a tuple of ``(poskeys, varkey, keys, optkey)``
|
|
|
|
where
|
2017-01-09 09:25:52 +03:00
|
|
|
|
|
|
|
- ``poskeys``: list of names of positional arguments
|
|
|
|
- ``varkey``: optional argument name that takes up remainder
|
|
|
|
- ``keys``: list of names that can be either positional or keyword arguments
|
2017-04-03 16:07:09 +03:00
|
|
|
- ``optkey``: optional argument name that takes up excess keyword arguments
|
2017-01-09 09:25:52 +03:00
|
|
|
|
|
|
|
If ``varkey`` specified, all ``keys`` must be given as keyword arguments.
|
|
|
|
|
|
|
|
Invalid keywords, too few positional arguments, or too many positional
|
|
|
|
arguments are rejected, but missing keyword arguments are just omitted.
|
2015-06-27 11:25:01 +03:00
|
|
|
"""
|
2017-04-03 16:07:09 +03:00
|
|
|
poskeys, varkey, keys, optkey = argspec
|
2017-01-09 09:15:21 +03:00
|
|
|
kwstart = next((i for i, x in enumerate(trees) if x[0] == keyvaluenode),
|
|
|
|
len(trees))
|
2017-01-09 09:25:52 +03:00
|
|
|
if kwstart < len(poskeys):
|
|
|
|
raise error.ParseError(_("%(func)s takes at least %(nargs)d positional "
|
|
|
|
"arguments")
|
|
|
|
% {'func': funcname, 'nargs': len(poskeys)})
|
2017-04-08 14:07:37 +03:00
|
|
|
if not varkey and kwstart > len(poskeys) + len(keys):
|
|
|
|
raise error.ParseError(_("%(func)s takes at most %(nargs)d positional "
|
|
|
|
"arguments")
|
2017-01-09 09:25:52 +03:00
|
|
|
% {'func': funcname,
|
|
|
|
'nargs': len(poskeys) + len(keys)})
|
2017-04-09 05:58:27 +03:00
|
|
|
args = util.sortdict()
|
2015-06-27 11:25:01 +03:00
|
|
|
# consume positional arguments
|
2017-01-09 09:25:52 +03:00
|
|
|
for k, x in zip(poskeys, trees[:kwstart]):
|
2015-06-27 11:25:01 +03:00
|
|
|
args[k] = x
|
2017-01-09 09:25:52 +03:00
|
|
|
if varkey:
|
|
|
|
args[varkey] = trees[len(args):kwstart]
|
|
|
|
else:
|
|
|
|
for k, x in zip(keys, trees[len(args):kwstart]):
|
|
|
|
args[k] = x
|
2015-06-27 11:25:01 +03:00
|
|
|
# remainder should be keyword arguments
|
2017-04-03 16:07:09 +03:00
|
|
|
if optkey:
|
2017-04-09 05:58:27 +03:00
|
|
|
args[optkey] = util.sortdict()
|
2017-01-09 09:15:21 +03:00
|
|
|
for x in trees[kwstart:]:
|
2015-06-27 11:25:01 +03:00
|
|
|
if x[0] != keyvaluenode or x[1][0] != keynode:
|
|
|
|
raise error.ParseError(_("%(func)s got an invalid argument")
|
|
|
|
% {'func': funcname})
|
|
|
|
k = x[1][1]
|
2017-04-03 16:07:09 +03:00
|
|
|
if k in keys:
|
|
|
|
d = args
|
|
|
|
elif not optkey:
|
2015-06-27 11:25:01 +03:00
|
|
|
raise error.ParseError(_("%(func)s got an unexpected keyword "
|
|
|
|
"argument '%(key)s'")
|
|
|
|
% {'func': funcname, 'key': k})
|
2017-04-03 16:07:09 +03:00
|
|
|
else:
|
|
|
|
d = args[optkey]
|
|
|
|
if k in d:
|
2015-06-27 11:25:01 +03:00
|
|
|
raise error.ParseError(_("%(func)s got multiple values for keyword "
|
|
|
|
"argument '%(key)s'")
|
|
|
|
% {'func': funcname, 'key': k})
|
2017-04-03 16:07:09 +03:00
|
|
|
d[k] = x[2]
|
2015-06-27 11:25:01 +03:00
|
|
|
return args
|
|
|
|
|
2015-09-10 17:25:10 +03:00
|
|
|
def unescapestr(s):
|
|
|
|
try:
|
2017-03-17 17:42:46 +03:00
|
|
|
return util.unescapestr(s)
|
2015-09-10 17:25:10 +03:00
|
|
|
except ValueError as e:
|
|
|
|
# mangle Python's exception into our format
|
|
|
|
raise error.ParseError(str(e).lower())
|
|
|
|
|
2017-09-03 15:17:25 +03:00
|
|
|
def _brepr(obj):
|
|
|
|
if isinstance(obj, bytes):
|
|
|
|
return b"'%s'" % util.escapestr(obj)
|
|
|
|
return encoding.strtolocal(repr(obj))
|
|
|
|
|
2015-05-06 04:17:41 +03:00
|
|
|
def _prettyformat(tree, leafnodes, level, lines):
|
2017-09-03 15:17:25 +03:00
|
|
|
if not isinstance(tree, tuple):
|
|
|
|
lines.append((level, _brepr(tree)))
|
|
|
|
elif tree[0] in leafnodes:
|
|
|
|
rs = map(_brepr, tree[1:])
|
|
|
|
lines.append((level, '(%s %s)' % (tree[0], ' '.join(rs))))
|
2015-05-06 04:17:41 +03:00
|
|
|
else:
|
|
|
|
lines.append((level, '(%s' % tree[0]))
|
|
|
|
for s in tree[1:]:
|
|
|
|
_prettyformat(s, leafnodes, level + 1, lines)
|
|
|
|
lines[-1:] = [(lines[-1][0], lines[-1][1] + ')')]
|
2015-04-26 16:20:03 +03:00
|
|
|
|
2015-05-06 04:17:41 +03:00
|
|
|
def prettyformat(tree, leafnodes):
|
2015-04-26 16:20:03 +03:00
|
|
|
lines = []
|
2015-05-06 04:17:41 +03:00
|
|
|
_prettyformat(tree, leafnodes, 0, lines)
|
2015-04-26 16:20:03 +03:00
|
|
|
output = '\n'.join((' ' * l + s) for l, s in lines)
|
|
|
|
return output
|
2015-04-26 12:05:23 +03:00
|
|
|
|
|
|
|
def simplifyinfixops(tree, targetnodes):
|
|
|
|
"""Flatten chained infix operations to reduce usage of Python stack
|
|
|
|
|
2017-09-03 08:56:31 +03:00
|
|
|
>>> from . import pycompat
|
2015-04-26 12:05:23 +03:00
|
|
|
>>> def f(tree):
|
2017-09-03 08:56:31 +03:00
|
|
|
... s = prettyformat(simplifyinfixops(tree, (b'or',)), (b'symbol',))
|
|
|
|
... print(pycompat.sysstr(s))
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> f((b'or',
|
|
|
|
... (b'or',
|
|
|
|
... (b'symbol', b'1'),
|
|
|
|
... (b'symbol', b'2')),
|
|
|
|
... (b'symbol', b'3')))
|
2015-04-26 12:05:23 +03:00
|
|
|
(or
|
2017-09-03 15:17:25 +03:00
|
|
|
(symbol '1')
|
|
|
|
(symbol '2')
|
|
|
|
(symbol '3'))
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> f((b'func',
|
|
|
|
... (b'symbol', b'p1'),
|
|
|
|
... (b'or',
|
|
|
|
... (b'or',
|
|
|
|
... (b'func',
|
|
|
|
... (b'symbol', b'sort'),
|
|
|
|
... (b'list',
|
|
|
|
... (b'or',
|
|
|
|
... (b'or',
|
|
|
|
... (b'symbol', b'1'),
|
|
|
|
... (b'symbol', b'2')),
|
|
|
|
... (b'symbol', b'3')),
|
|
|
|
... (b'negate',
|
|
|
|
... (b'symbol', b'rev')))),
|
|
|
|
... (b'and',
|
|
|
|
... (b'symbol', b'4'),
|
|
|
|
... (b'group',
|
|
|
|
... (b'or',
|
|
|
|
... (b'or',
|
|
|
|
... (b'symbol', b'5'),
|
|
|
|
... (b'symbol', b'6')),
|
|
|
|
... (b'symbol', b'7'))))),
|
|
|
|
... (b'symbol', b'8'))))
|
2015-04-26 12:05:23 +03:00
|
|
|
(func
|
2017-09-03 15:17:25 +03:00
|
|
|
(symbol 'p1')
|
2015-04-26 12:05:23 +03:00
|
|
|
(or
|
|
|
|
(func
|
2017-09-03 15:17:25 +03:00
|
|
|
(symbol 'sort')
|
2015-04-26 12:05:23 +03:00
|
|
|
(list
|
|
|
|
(or
|
2017-09-03 15:17:25 +03:00
|
|
|
(symbol '1')
|
|
|
|
(symbol '2')
|
|
|
|
(symbol '3'))
|
2015-04-26 12:05:23 +03:00
|
|
|
(negate
|
2017-09-03 15:17:25 +03:00
|
|
|
(symbol 'rev'))))
|
2015-04-26 12:05:23 +03:00
|
|
|
(and
|
2017-09-03 15:17:25 +03:00
|
|
|
(symbol '4')
|
2015-04-26 12:05:23 +03:00
|
|
|
(group
|
|
|
|
(or
|
2017-09-03 15:17:25 +03:00
|
|
|
(symbol '5')
|
|
|
|
(symbol '6')
|
|
|
|
(symbol '7'))))
|
|
|
|
(symbol '8')))
|
2015-04-26 12:05:23 +03:00
|
|
|
"""
|
|
|
|
if not isinstance(tree, tuple):
|
|
|
|
return tree
|
|
|
|
op = tree[0]
|
|
|
|
if op not in targetnodes:
|
|
|
|
return (op,) + tuple(simplifyinfixops(x, targetnodes) for x in tree[1:])
|
|
|
|
|
|
|
|
# walk down left nodes taking each right node. no recursion to left nodes
|
|
|
|
# because infix operators are left-associative, i.e. left tree is deep.
|
|
|
|
# e.g. '1 + 2 + 3' -> (+ (+ 1 2) 3) -> (+ 1 2 3)
|
|
|
|
simplified = []
|
|
|
|
x = tree
|
|
|
|
while x[0] == op:
|
|
|
|
l, r = x[1:]
|
|
|
|
simplified.append(simplifyinfixops(r, targetnodes))
|
|
|
|
x = l
|
|
|
|
simplified.append(simplifyinfixops(x, targetnodes))
|
|
|
|
simplified.append(op)
|
|
|
|
return tuple(reversed(simplified))
|
2016-02-29 11:02:56 +03:00
|
|
|
|
2016-02-17 15:30:04 +03:00
|
|
|
def _buildtree(template, placeholder, replstack):
|
|
|
|
if template == placeholder:
|
|
|
|
return replstack.pop()
|
|
|
|
if not isinstance(template, tuple):
|
|
|
|
return template
|
|
|
|
return tuple(_buildtree(x, placeholder, replstack) for x in template)
|
|
|
|
|
|
|
|
def buildtree(template, placeholder, *repls):
|
|
|
|
"""Create new tree by substituting placeholders by replacements
|
|
|
|
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> _ = (b'symbol', b'_')
|
2016-02-17 15:30:04 +03:00
|
|
|
>>> def f(template, *repls):
|
|
|
|
... return buildtree(template, _, *repls)
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> f((b'func', (b'symbol', b'only'), (b'list', _, _)),
|
2016-02-17 15:30:04 +03:00
|
|
|
... ('symbol', '1'), ('symbol', '2'))
|
|
|
|
('func', ('symbol', 'only'), ('list', ('symbol', '1'), ('symbol', '2')))
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> f((b'and', _, (b'not', _)), (b'symbol', b'1'), (b'symbol', b'2'))
|
2016-02-17 15:30:04 +03:00
|
|
|
('and', ('symbol', '1'), ('not', ('symbol', '2')))
|
|
|
|
"""
|
|
|
|
if not isinstance(placeholder, tuple):
|
|
|
|
raise error.ProgrammingError('placeholder must be a node tuple')
|
|
|
|
replstack = list(reversed(repls))
|
|
|
|
r = _buildtree(template, placeholder, replstack)
|
|
|
|
if replstack:
|
|
|
|
raise error.ProgrammingError('too many replacements')
|
|
|
|
return r
|
|
|
|
|
2016-02-17 15:31:09 +03:00
|
|
|
def _matchtree(pattern, tree, placeholder, incompletenodes, matches):
|
|
|
|
if pattern == tree:
|
|
|
|
return True
|
|
|
|
if not isinstance(pattern, tuple) or not isinstance(tree, tuple):
|
|
|
|
return False
|
|
|
|
if pattern == placeholder and tree[0] not in incompletenodes:
|
|
|
|
matches.append(tree)
|
|
|
|
return True
|
|
|
|
if len(pattern) != len(tree):
|
|
|
|
return False
|
|
|
|
return all(_matchtree(p, x, placeholder, incompletenodes, matches)
|
|
|
|
for p, x in zip(pattern, tree))
|
|
|
|
|
|
|
|
def matchtree(pattern, tree, placeholder=None, incompletenodes=()):
|
|
|
|
"""If a tree matches the pattern, return a list of the tree and nodes
|
|
|
|
matched with the placeholder; Otherwise None
|
|
|
|
|
|
|
|
>>> def f(pattern, tree):
|
2017-09-03 08:32:11 +03:00
|
|
|
... m = matchtree(pattern, tree, _, {b'keyvalue', b'list'})
|
2016-02-17 15:31:09 +03:00
|
|
|
... if m:
|
|
|
|
... return m[1:]
|
|
|
|
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> _ = (b'symbol', b'_')
|
|
|
|
>>> f((b'func', (b'symbol', b'ancestors'), _),
|
|
|
|
... (b'func', (b'symbol', b'ancestors'), (b'symbol', b'1')))
|
2016-02-17 15:31:09 +03:00
|
|
|
[('symbol', '1')]
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> f((b'func', (b'symbol', b'ancestors'), _),
|
|
|
|
... (b'func', (b'symbol', b'ancestors'), None))
|
|
|
|
>>> f((b'range', (b'dagrange', _, _), _),
|
|
|
|
... (b'range',
|
|
|
|
... (b'dagrange', (b'symbol', b'1'), (b'symbol', b'2')),
|
|
|
|
... (b'symbol', b'3')))
|
2016-02-17 15:31:09 +03:00
|
|
|
[('symbol', '1'), ('symbol', '2'), ('symbol', '3')]
|
|
|
|
|
|
|
|
The placeholder does not match the specified incomplete nodes because
|
|
|
|
an incomplete node (e.g. argument list) cannot construct an expression.
|
|
|
|
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> f((b'func', (b'symbol', b'ancestors'), _),
|
|
|
|
... (b'func', (b'symbol', b'ancestors'),
|
|
|
|
... (b'list', (b'symbol', b'1'), (b'symbol', b'2'))))
|
2016-02-17 15:31:09 +03:00
|
|
|
|
|
|
|
The placeholder may be omitted, but which shouldn't match a None node.
|
|
|
|
|
|
|
|
>>> _ = None
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> f((b'func', (b'symbol', b'ancestors'), None),
|
|
|
|
... (b'func', (b'symbol', b'ancestors'), (b'symbol', b'0')))
|
2016-02-17 15:31:09 +03:00
|
|
|
"""
|
|
|
|
if placeholder is not None and not isinstance(placeholder, tuple):
|
|
|
|
raise error.ProgrammingError('placeholder must be a node tuple')
|
|
|
|
matches = [tree]
|
|
|
|
if _matchtree(pattern, tree, placeholder, incompletenodes, matches):
|
|
|
|
return matches
|
|
|
|
|
2016-02-29 11:02:56 +03:00
|
|
|
def parseerrordetail(inst):
|
|
|
|
"""Compose error message from specified ParseError object
|
|
|
|
"""
|
|
|
|
if len(inst.args) > 1:
|
2017-03-12 08:44:59 +03:00
|
|
|
return _('at %d: %s') % (inst.args[1], inst.args[0])
|
2016-02-29 11:02:56 +03:00
|
|
|
else:
|
|
|
|
return inst.args[0]
|
parser: add stub class that will host alias parsing and expansion
This class will keep syntax rules that are necessary to parse and expand
aliases. The implementations will be extracted from the revset module. In
order to make the porting easier, this class keeps parsedecl and parsedefn
separately, which will be unified later. Also, getlist and funcnode will
be refactored by future patches for better handling of the template aliases.
The following public functions will be added:
aliasrules.build(decl, defn) -> aliasobj
parse decl and defn into an object that keeps alias name, arguments
and replacement tree.
aliasrules.buildmap(aliasitems) -> aliasdict
helper to build() a dict of alias objects from a list of (decl, defn)
aliasrules.expand(aliasdict, tree) -> tree
expand aliases in tree recursively
Because these functions aren't introduced by this series, there would remain
a few wrapper functions in the revset module. These ugly wrappers should be
eliminated by the next series.
This class is considered an inheritable namespace, which will host only
class/static methods. That's because it won't have no object-scope variables.
I'm not a big fan of using class as a syntax sugar, but I admit it can improve
code readability at some level. So let's give it a try.
2016-04-03 10:55:23 +03:00
|
|
|
|
2016-02-29 12:33:30 +03:00
|
|
|
class alias(object):
|
|
|
|
"""Parsed result of alias"""
|
|
|
|
|
2016-03-29 10:50:16 +03:00
|
|
|
def __init__(self, name, args, err, replacement):
|
2016-02-29 12:33:30 +03:00
|
|
|
self.name = name
|
|
|
|
self.args = args
|
|
|
|
self.error = err
|
|
|
|
self.replacement = replacement
|
|
|
|
# whether own `error` information is already shown or not.
|
2016-02-29 16:58:15 +03:00
|
|
|
# this avoids showing same warning multiple times at each
|
|
|
|
# `expandaliases`.
|
2016-02-29 12:33:30 +03:00
|
|
|
self.warned = False
|
|
|
|
|
parser: add stub class that will host alias parsing and expansion
This class will keep syntax rules that are necessary to parse and expand
aliases. The implementations will be extracted from the revset module. In
order to make the porting easier, this class keeps parsedecl and parsedefn
separately, which will be unified later. Also, getlist and funcnode will
be refactored by future patches for better handling of the template aliases.
The following public functions will be added:
aliasrules.build(decl, defn) -> aliasobj
parse decl and defn into an object that keeps alias name, arguments
and replacement tree.
aliasrules.buildmap(aliasitems) -> aliasdict
helper to build() a dict of alias objects from a list of (decl, defn)
aliasrules.expand(aliasdict, tree) -> tree
expand aliases in tree recursively
Because these functions aren't introduced by this series, there would remain
a few wrapper functions in the revset module. These ugly wrappers should be
eliminated by the next series.
This class is considered an inheritable namespace, which will host only
class/static methods. That's because it won't have no object-scope variables.
I'm not a big fan of using class as a syntax sugar, but I admit it can improve
code readability at some level. So let's give it a try.
2016-04-03 10:55:23 +03:00
|
|
|
class basealiasrules(object):
|
|
|
|
"""Parsing and expansion rule set of aliases
|
|
|
|
|
|
|
|
This is a helper for fileset/revset/template aliases. A concrete rule set
|
|
|
|
should be made by sub-classing this and implementing class/static methods.
|
|
|
|
|
2016-10-18 00:16:55 +03:00
|
|
|
It supports alias expansion of symbol and function-call styles::
|
parser: add stub class that will host alias parsing and expansion
This class will keep syntax rules that are necessary to parse and expand
aliases. The implementations will be extracted from the revset module. In
order to make the porting easier, this class keeps parsedecl and parsedefn
separately, which will be unified later. Also, getlist and funcnode will
be refactored by future patches for better handling of the template aliases.
The following public functions will be added:
aliasrules.build(decl, defn) -> aliasobj
parse decl and defn into an object that keeps alias name, arguments
and replacement tree.
aliasrules.buildmap(aliasitems) -> aliasdict
helper to build() a dict of alias objects from a list of (decl, defn)
aliasrules.expand(aliasdict, tree) -> tree
expand aliases in tree recursively
Because these functions aren't introduced by this series, there would remain
a few wrapper functions in the revset module. These ugly wrappers should be
eliminated by the next series.
This class is considered an inheritable namespace, which will host only
class/static methods. That's because it won't have no object-scope variables.
I'm not a big fan of using class as a syntax sugar, but I admit it can improve
code readability at some level. So let's give it a try.
2016-04-03 10:55:23 +03:00
|
|
|
|
|
|
|
# decl = defn
|
|
|
|
h = heads(default)
|
|
|
|
b($1) = ancestors($1) - ancestors(default)
|
|
|
|
"""
|
|
|
|
# typically a config section, which will be included in error messages
|
|
|
|
_section = None
|
2016-03-29 11:27:34 +03:00
|
|
|
# tag of symbol node
|
parser: add stub class that will host alias parsing and expansion
This class will keep syntax rules that are necessary to parse and expand
aliases. The implementations will be extracted from the revset module. In
order to make the porting easier, this class keeps parsedecl and parsedefn
separately, which will be unified later. Also, getlist and funcnode will
be refactored by future patches for better handling of the template aliases.
The following public functions will be added:
aliasrules.build(decl, defn) -> aliasobj
parse decl and defn into an object that keeps alias name, arguments
and replacement tree.
aliasrules.buildmap(aliasitems) -> aliasdict
helper to build() a dict of alias objects from a list of (decl, defn)
aliasrules.expand(aliasdict, tree) -> tree
expand aliases in tree recursively
Because these functions aren't introduced by this series, there would remain
a few wrapper functions in the revset module. These ugly wrappers should be
eliminated by the next series.
This class is considered an inheritable namespace, which will host only
class/static methods. That's because it won't have no object-scope variables.
I'm not a big fan of using class as a syntax sugar, but I admit it can improve
code readability at some level. So let's give it a try.
2016-04-03 10:55:23 +03:00
|
|
|
_symbolnode = 'symbol'
|
|
|
|
|
|
|
|
def __new__(cls):
|
|
|
|
raise TypeError("'%s' is not instantiatable" % cls.__name__)
|
|
|
|
|
|
|
|
@staticmethod
|
2016-03-28 18:08:25 +03:00
|
|
|
def _parse(spec):
|
|
|
|
"""Parse an alias name, arguments and definition"""
|
parser: add stub class that will host alias parsing and expansion
This class will keep syntax rules that are necessary to parse and expand
aliases. The implementations will be extracted from the revset module. In
order to make the porting easier, this class keeps parsedecl and parsedefn
separately, which will be unified later. Also, getlist and funcnode will
be refactored by future patches for better handling of the template aliases.
The following public functions will be added:
aliasrules.build(decl, defn) -> aliasobj
parse decl and defn into an object that keeps alias name, arguments
and replacement tree.
aliasrules.buildmap(aliasitems) -> aliasdict
helper to build() a dict of alias objects from a list of (decl, defn)
aliasrules.expand(aliasdict, tree) -> tree
expand aliases in tree recursively
Because these functions aren't introduced by this series, there would remain
a few wrapper functions in the revset module. These ugly wrappers should be
eliminated by the next series.
This class is considered an inheritable namespace, which will host only
class/static methods. That's because it won't have no object-scope variables.
I'm not a big fan of using class as a syntax sugar, but I admit it can improve
code readability at some level. So let's give it a try.
2016-04-03 10:55:23 +03:00
|
|
|
raise NotImplementedError
|
|
|
|
|
|
|
|
@staticmethod
|
2016-03-29 11:27:34 +03:00
|
|
|
def _trygetfunc(tree):
|
|
|
|
"""Return (name, args) if tree is a function; otherwise None"""
|
parser: add stub class that will host alias parsing and expansion
This class will keep syntax rules that are necessary to parse and expand
aliases. The implementations will be extracted from the revset module. In
order to make the porting easier, this class keeps parsedecl and parsedefn
separately, which will be unified later. Also, getlist and funcnode will
be refactored by future patches for better handling of the template aliases.
The following public functions will be added:
aliasrules.build(decl, defn) -> aliasobj
parse decl and defn into an object that keeps alias name, arguments
and replacement tree.
aliasrules.buildmap(aliasitems) -> aliasdict
helper to build() a dict of alias objects from a list of (decl, defn)
aliasrules.expand(aliasdict, tree) -> tree
expand aliases in tree recursively
Because these functions aren't introduced by this series, there would remain
a few wrapper functions in the revset module. These ugly wrappers should be
eliminated by the next series.
This class is considered an inheritable namespace, which will host only
class/static methods. That's because it won't have no object-scope variables.
I'm not a big fan of using class as a syntax sugar, but I admit it can improve
code readability at some level. So let's give it a try.
2016-04-03 10:55:23 +03:00
|
|
|
raise NotImplementedError
|
2016-02-29 11:54:03 +03:00
|
|
|
|
|
|
|
@classmethod
|
|
|
|
def _builddecl(cls, decl):
|
2016-03-29 10:50:16 +03:00
|
|
|
"""Parse an alias declaration into ``(name, args, errorstr)``
|
2016-02-29 11:54:03 +03:00
|
|
|
|
|
|
|
This function analyzes the parsed tree. The parsing rule is provided
|
2016-03-28 18:08:25 +03:00
|
|
|
by ``_parse()``.
|
2016-02-29 11:54:03 +03:00
|
|
|
|
|
|
|
- ``name``: of declared alias (may be ``decl`` itself at error)
|
|
|
|
- ``args``: list of argument names (or None for symbol declaration)
|
|
|
|
- ``errorstr``: detail about detected error (or None)
|
|
|
|
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> sym = lambda x: (b'symbol', x)
|
|
|
|
>>> symlist = lambda *xs: (b'list',) + tuple(sym(x) for x in xs)
|
|
|
|
>>> func = lambda n, a: (b'func', sym(n), a)
|
2016-02-29 11:54:03 +03:00
|
|
|
>>> parsemap = {
|
2017-09-03 08:32:11 +03:00
|
|
|
... b'foo': sym(b'foo'),
|
|
|
|
... b'$foo': sym(b'$foo'),
|
|
|
|
... b'foo::bar': (b'dagrange', sym(b'foo'), sym(b'bar')),
|
|
|
|
... b'foo()': func(b'foo', None),
|
|
|
|
... b'$foo()': func(b'$foo', None),
|
|
|
|
... b'foo($1, $2)': func(b'foo', symlist(b'$1', b'$2')),
|
|
|
|
... b'foo(bar_bar, baz.baz)':
|
|
|
|
... func(b'foo', symlist(b'bar_bar', b'baz.baz')),
|
|
|
|
... b'foo(bar($1, $2))':
|
|
|
|
... func(b'foo', func(b'bar', symlist(b'$1', b'$2'))),
|
|
|
|
... b'foo($1, $2, nested($1, $2))':
|
|
|
|
... func(b'foo', (symlist(b'$1', b'$2') +
|
|
|
|
... (func(b'nested', symlist(b'$1', b'$2')),))),
|
|
|
|
... b'foo("bar")': func(b'foo', (b'string', b'bar')),
|
|
|
|
... b'foo($1, $2': error.ParseError(b'unexpected token: end', 10),
|
|
|
|
... b'foo("bar': error.ParseError(b'unterminated string', 5),
|
|
|
|
... b'foo($1, $2, $1)': func(b'foo', symlist(b'$1', b'$2', b'$1')),
|
2016-02-29 11:54:03 +03:00
|
|
|
... }
|
|
|
|
>>> def parse(expr):
|
|
|
|
... x = parsemap[expr]
|
|
|
|
... if isinstance(x, Exception):
|
|
|
|
... raise x
|
|
|
|
... return x
|
2016-03-29 11:27:34 +03:00
|
|
|
>>> def trygetfunc(tree):
|
2017-09-03 08:32:11 +03:00
|
|
|
... if not tree or tree[0] != b'func' or tree[1][0] != b'symbol':
|
2016-03-29 11:27:34 +03:00
|
|
|
... return None
|
|
|
|
... if not tree[2]:
|
|
|
|
... return tree[1][1], []
|
2017-09-03 08:32:11 +03:00
|
|
|
... if tree[2][0] == b'list':
|
2016-03-29 11:27:34 +03:00
|
|
|
... return tree[1][1], list(tree[2][1:])
|
|
|
|
... return tree[1][1], [tree[2]]
|
2016-02-29 11:54:03 +03:00
|
|
|
>>> class aliasrules(basealiasrules):
|
2016-03-28 18:08:25 +03:00
|
|
|
... _parse = staticmethod(parse)
|
2016-03-29 11:27:34 +03:00
|
|
|
... _trygetfunc = staticmethod(trygetfunc)
|
2016-02-29 11:54:03 +03:00
|
|
|
>>> builddecl = aliasrules._builddecl
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> builddecl(b'foo')
|
2016-03-29 10:50:16 +03:00
|
|
|
('foo', None, None)
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> builddecl(b'$foo')
|
2016-04-17 06:20:57 +03:00
|
|
|
('$foo', None, "invalid symbol '$foo'")
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> builddecl(b'foo::bar')
|
2016-03-29 10:50:16 +03:00
|
|
|
('foo::bar', None, 'invalid format')
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> builddecl(b'foo()')
|
2016-03-29 10:50:16 +03:00
|
|
|
('foo', [], None)
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> builddecl(b'$foo()')
|
2016-04-17 06:20:57 +03:00
|
|
|
('$foo()', None, "invalid function '$foo'")
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> builddecl(b'foo($1, $2)')
|
2016-03-29 10:50:16 +03:00
|
|
|
('foo', ['$1', '$2'], None)
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> builddecl(b'foo(bar_bar, baz.baz)')
|
2016-03-29 10:50:16 +03:00
|
|
|
('foo', ['bar_bar', 'baz.baz'], None)
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> builddecl(b'foo($1, $2, nested($1, $2))')
|
2016-03-29 10:50:16 +03:00
|
|
|
('foo($1, $2, nested($1, $2))', None, 'invalid argument list')
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> builddecl(b'foo(bar($1, $2))')
|
2016-03-29 10:50:16 +03:00
|
|
|
('foo(bar($1, $2))', None, 'invalid argument list')
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> builddecl(b'foo("bar")')
|
2016-03-29 10:50:16 +03:00
|
|
|
('foo("bar")', None, 'invalid argument list')
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> builddecl(b'foo($1, $2')
|
2016-03-29 10:50:16 +03:00
|
|
|
('foo($1, $2', None, 'at 10: unexpected token: end')
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> builddecl(b'foo("bar')
|
2016-03-29 10:50:16 +03:00
|
|
|
('foo("bar', None, 'at 5: unterminated string')
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> builddecl(b'foo($1, $2, $1)')
|
2016-03-29 10:50:16 +03:00
|
|
|
('foo', None, 'argument names collide with each other')
|
2016-02-29 11:54:03 +03:00
|
|
|
"""
|
|
|
|
try:
|
2016-03-28 18:08:25 +03:00
|
|
|
tree = cls._parse(decl)
|
2016-02-29 11:54:03 +03:00
|
|
|
except error.ParseError as inst:
|
2016-03-29 10:50:16 +03:00
|
|
|
return (decl, None, parseerrordetail(inst))
|
2016-02-29 11:54:03 +03:00
|
|
|
|
|
|
|
if tree[0] == cls._symbolnode:
|
|
|
|
# "name = ...." style
|
|
|
|
name = tree[1]
|
|
|
|
if name.startswith('$'):
|
2016-04-17 06:20:57 +03:00
|
|
|
return (decl, None, _("invalid symbol '%s'") % name)
|
2016-03-29 10:50:16 +03:00
|
|
|
return (name, None, None)
|
2016-02-29 11:54:03 +03:00
|
|
|
|
2016-03-29 11:27:34 +03:00
|
|
|
func = cls._trygetfunc(tree)
|
|
|
|
if func:
|
2016-02-29 11:54:03 +03:00
|
|
|
# "name(arg, ....) = ...." style
|
2016-03-29 11:27:34 +03:00
|
|
|
name, args = func
|
2016-02-29 11:54:03 +03:00
|
|
|
if name.startswith('$'):
|
2016-04-17 06:20:57 +03:00
|
|
|
return (decl, None, _("invalid function '%s'") % name)
|
2016-03-29 11:27:34 +03:00
|
|
|
if any(t[0] != cls._symbolnode for t in args):
|
|
|
|
return (decl, None, _("invalid argument list"))
|
2016-02-29 11:54:03 +03:00
|
|
|
if len(args) != len(set(args)):
|
2016-03-29 10:50:16 +03:00
|
|
|
return (name, None, _("argument names collide with each other"))
|
2016-03-29 11:27:34 +03:00
|
|
|
return (name, [t[1] for t in args], None)
|
2016-02-29 11:54:03 +03:00
|
|
|
|
2016-03-29 10:50:16 +03:00
|
|
|
return (decl, None, _("invalid format"))
|
2016-02-29 12:00:51 +03:00
|
|
|
|
|
|
|
@classmethod
|
|
|
|
def _relabelargs(cls, tree, args):
|
|
|
|
"""Mark alias arguments as ``_aliasarg``"""
|
|
|
|
if not isinstance(tree, tuple):
|
|
|
|
return tree
|
|
|
|
op = tree[0]
|
|
|
|
if op != cls._symbolnode:
|
|
|
|
return (op,) + tuple(cls._relabelargs(x, args) for x in tree[1:])
|
|
|
|
|
|
|
|
assert len(tree) == 2
|
|
|
|
sym = tree[1]
|
|
|
|
if sym in args:
|
|
|
|
op = '_aliasarg'
|
|
|
|
elif sym.startswith('$'):
|
2016-04-17 06:20:57 +03:00
|
|
|
raise error.ParseError(_("invalid symbol '%s'") % sym)
|
2016-02-29 12:00:51 +03:00
|
|
|
return (op, sym)
|
2016-02-29 12:10:07 +03:00
|
|
|
|
|
|
|
@classmethod
|
|
|
|
def _builddefn(cls, defn, args):
|
|
|
|
"""Parse an alias definition into a tree and marks substitutions
|
|
|
|
|
|
|
|
This function marks alias argument references as ``_aliasarg``. The
|
2016-03-28 18:08:25 +03:00
|
|
|
parsing rule is provided by ``_parse()``.
|
2016-02-29 12:10:07 +03:00
|
|
|
|
|
|
|
``args`` is a list of alias argument names, or None if the alias
|
|
|
|
is declared as a symbol.
|
|
|
|
|
2017-09-03 08:56:31 +03:00
|
|
|
>>> from . import pycompat
|
2016-02-29 12:10:07 +03:00
|
|
|
>>> parsemap = {
|
2017-09-03 08:32:11 +03:00
|
|
|
... b'$1 or foo': (b'or', (b'symbol', b'$1'), (b'symbol', b'foo')),
|
|
|
|
... b'$1 or $bar':
|
|
|
|
... (b'or', (b'symbol', b'$1'), (b'symbol', b'$bar')),
|
|
|
|
... b'$10 or baz':
|
|
|
|
... (b'or', (b'symbol', b'$10'), (b'symbol', b'baz')),
|
|
|
|
... b'"$1" or "foo"':
|
|
|
|
... (b'or', (b'string', b'$1'), (b'string', b'foo')),
|
2016-02-29 12:10:07 +03:00
|
|
|
... }
|
|
|
|
>>> class aliasrules(basealiasrules):
|
2016-03-28 18:08:25 +03:00
|
|
|
... _parse = staticmethod(parsemap.__getitem__)
|
2016-03-29 11:27:34 +03:00
|
|
|
... _trygetfunc = staticmethod(lambda x: None)
|
2016-02-29 12:10:07 +03:00
|
|
|
>>> builddefn = aliasrules._builddefn
|
|
|
|
>>> def pprint(tree):
|
2017-09-03 08:56:31 +03:00
|
|
|
... s = prettyformat(tree, (b'_aliasarg', b'string', b'symbol'))
|
|
|
|
... print(pycompat.sysstr(s))
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> args = [b'$1', b'$2', b'foo']
|
|
|
|
>>> pprint(builddefn(b'$1 or foo', args))
|
2016-02-29 12:10:07 +03:00
|
|
|
(or
|
2017-09-03 15:17:25 +03:00
|
|
|
(_aliasarg '$1')
|
|
|
|
(_aliasarg 'foo'))
|
2016-02-29 12:10:07 +03:00
|
|
|
>>> try:
|
2017-09-03 08:32:11 +03:00
|
|
|
... builddefn(b'$1 or $bar', args)
|
2016-02-29 12:10:07 +03:00
|
|
|
... except error.ParseError as inst:
|
2017-09-03 08:56:31 +03:00
|
|
|
... print(pycompat.sysstr(parseerrordetail(inst)))
|
2016-04-17 06:20:57 +03:00
|
|
|
invalid symbol '$bar'
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> args = [b'$1', b'$10', b'foo']
|
|
|
|
>>> pprint(builddefn(b'$10 or baz', args))
|
2016-02-29 12:10:07 +03:00
|
|
|
(or
|
2017-09-03 15:17:25 +03:00
|
|
|
(_aliasarg '$10')
|
|
|
|
(symbol 'baz'))
|
2017-09-03 08:32:11 +03:00
|
|
|
>>> pprint(builddefn(b'"$1" or "foo"', args))
|
2016-02-29 12:10:07 +03:00
|
|
|
(or
|
2017-09-03 15:17:25 +03:00
|
|
|
(string '$1')
|
|
|
|
(string 'foo'))
|
2016-02-29 12:10:07 +03:00
|
|
|
"""
|
2016-03-28 18:08:25 +03:00
|
|
|
tree = cls._parse(defn)
|
2016-02-29 12:10:07 +03:00
|
|
|
if args:
|
|
|
|
args = set(args)
|
|
|
|
else:
|
|
|
|
args = set()
|
|
|
|
return cls._relabelargs(tree, args)
|
2016-02-29 12:33:30 +03:00
|
|
|
|
|
|
|
@classmethod
|
|
|
|
def build(cls, decl, defn):
|
|
|
|
"""Parse an alias declaration and definition into an alias object"""
|
|
|
|
repl = efmt = None
|
2016-03-29 10:50:16 +03:00
|
|
|
name, args, err = cls._builddecl(decl)
|
2016-02-29 12:33:30 +03:00
|
|
|
if err:
|
2016-04-17 06:31:06 +03:00
|
|
|
efmt = _('bad declaration of %(section)s "%(name)s": %(error)s')
|
2016-02-29 12:33:30 +03:00
|
|
|
else:
|
|
|
|
try:
|
|
|
|
repl = cls._builddefn(defn, args)
|
|
|
|
except error.ParseError as inst:
|
|
|
|
err = parseerrordetail(inst)
|
2016-04-17 06:31:06 +03:00
|
|
|
efmt = _('bad definition of %(section)s "%(name)s": %(error)s')
|
2016-02-29 12:33:30 +03:00
|
|
|
if err:
|
|
|
|
err = efmt % {'section': cls._section, 'name': name, 'error': err}
|
2016-03-29 10:50:16 +03:00
|
|
|
return alias(name, args, err, repl)
|
2016-02-29 13:24:15 +03:00
|
|
|
|
|
|
|
@classmethod
|
|
|
|
def buildmap(cls, items):
|
|
|
|
"""Parse a list of alias (name, replacement) pairs into a dict of
|
|
|
|
alias objects"""
|
|
|
|
aliases = {}
|
|
|
|
for decl, defn in items:
|
|
|
|
a = cls.build(decl, defn)
|
|
|
|
aliases[a.name] = a
|
|
|
|
return aliases
|
2016-02-29 16:15:44 +03:00
|
|
|
|
|
|
|
@classmethod
|
|
|
|
def _getalias(cls, aliases, tree):
|
2016-03-29 11:21:11 +03:00
|
|
|
"""If tree looks like an unexpanded alias, return (alias, pattern-args)
|
|
|
|
pair. Return None otherwise.
|
2016-02-29 16:15:44 +03:00
|
|
|
"""
|
|
|
|
if not isinstance(tree, tuple):
|
|
|
|
return None
|
|
|
|
if tree[0] == cls._symbolnode:
|
|
|
|
name = tree[1]
|
|
|
|
a = aliases.get(name)
|
2016-03-29 10:50:16 +03:00
|
|
|
if a and a.args is None:
|
2016-03-29 11:21:11 +03:00
|
|
|
return a, None
|
2016-03-29 11:27:34 +03:00
|
|
|
func = cls._trygetfunc(tree)
|
|
|
|
if func:
|
|
|
|
name, args = func
|
2016-02-29 16:15:44 +03:00
|
|
|
a = aliases.get(name)
|
2016-03-29 10:50:16 +03:00
|
|
|
if a and a.args is not None:
|
2016-03-29 11:27:34 +03:00
|
|
|
return a, args
|
2016-02-29 16:15:44 +03:00
|
|
|
return None
|
|
|
|
|
|
|
|
@classmethod
|
|
|
|
def _expandargs(cls, tree, args):
|
|
|
|
"""Replace _aliasarg instances with the substitution value of the
|
|
|
|
same name in args, recursively.
|
|
|
|
"""
|
|
|
|
if not isinstance(tree, tuple):
|
|
|
|
return tree
|
|
|
|
if tree[0] == '_aliasarg':
|
|
|
|
sym = tree[1]
|
|
|
|
return args[sym]
|
|
|
|
return tuple(cls._expandargs(t, args) for t in tree)
|
|
|
|
|
|
|
|
@classmethod
|
|
|
|
def _expand(cls, aliases, tree, expanding, cache):
|
|
|
|
if not isinstance(tree, tuple):
|
|
|
|
return tree
|
2016-03-29 11:21:11 +03:00
|
|
|
r = cls._getalias(aliases, tree)
|
|
|
|
if r is None:
|
2016-03-29 10:19:31 +03:00
|
|
|
return tuple(cls._expand(aliases, t, expanding, cache)
|
|
|
|
for t in tree)
|
2016-03-29 11:21:11 +03:00
|
|
|
a, l = r
|
2016-03-29 10:19:31 +03:00
|
|
|
if a.error:
|
|
|
|
raise error.Abort(a.error)
|
|
|
|
if a in expanding:
|
|
|
|
raise error.ParseError(_('infinite expansion of %(section)s '
|
|
|
|
'"%(name)s" detected')
|
|
|
|
% {'section': cls._section, 'name': a.name})
|
2016-03-29 10:30:59 +03:00
|
|
|
# get cacheable replacement tree by expanding aliases recursively
|
2016-03-29 10:19:31 +03:00
|
|
|
expanding.append(a)
|
|
|
|
if a.name not in cache:
|
|
|
|
cache[a.name] = cls._expand(aliases, a.replacement, expanding,
|
|
|
|
cache)
|
|
|
|
result = cache[a.name]
|
|
|
|
expanding.pop()
|
|
|
|
if a.args is None:
|
|
|
|
return result
|
2016-03-29 10:30:59 +03:00
|
|
|
# substitute function arguments in replacement tree
|
2016-03-29 10:19:31 +03:00
|
|
|
if len(l) != len(a.args):
|
|
|
|
raise error.ParseError(_('invalid number of arguments: %d')
|
|
|
|
% len(l))
|
|
|
|
l = [cls._expand(aliases, t, [], cache) for t in l]
|
|
|
|
return cls._expandargs(result, dict(zip(a.args, l)))
|
2016-02-29 16:15:44 +03:00
|
|
|
|
|
|
|
@classmethod
|
|
|
|
def expand(cls, aliases, tree):
|
|
|
|
"""Expand aliases in tree, recursively.
|
|
|
|
|
|
|
|
'aliases' is a dictionary mapping user defined aliases to alias objects.
|
|
|
|
"""
|
|
|
|
return cls._expand(aliases, tree, [], {})
|