Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Sign in
Toggle navigation
D
DHParser
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Locked Files
Issues
0
Issues
0
List
Boards
Labels
Service Desk
Milestones
Iterations
Merge Requests
0
Merge Requests
0
Requirements
Requirements
List
Security & Compliance
Security & Compliance
Dependency List
License Compliance
Operations
Operations
Incidents
Analytics
Analytics
Code Review
Insights
Issue
Repository
Value Stream
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
badw-it
DHParser
Commits
468e2931
Commit
468e2931
authored
Sep 18, 2017
by
Eckhart Arnold
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
- extraced classes Error, StringView, ParserBase, MockParser and ZombieParser to new module base.py
parent
ff94e91c
Changes
16
Hide whitespace changes
Inline
Side-by-side
Showing
16 changed files
with
473 additions
and
395 deletions
+473
-395
DHParser/__init__.py
DHParser/__init__.py
+2
-1
DHParser/base.py
DHParser/base.py
+300
-0
DHParser/dsl.py
DHParser/dsl.py
+3
-2
DHParser/ebnf.py
DHParser/ebnf.py
+2
-1
DHParser/parser.py
DHParser/parser.py
+9
-9
DHParser/syntaxtree.py
DHParser/syntaxtree.py
+5
-146
DHParser/testing.py
DHParser/testing.py
+2
-1
DHParser/toolkit.py
DHParser/toolkit.py
+7
-128
DHParser/transform.py
DHParser/transform.py
+2
-1
test/test_base.py
test/test_base.py
+130
-0
test/test_dsl.py
test/test_dsl.py
+1
-1
test/test_ebnf.py
test/test_ebnf.py
+2
-2
test/test_parser.py
test/test_parser.py
+2
-1
test/test_syntaxtree.py
test/test_syntaxtree.py
+2
-1
test/test_testing.py
test/test_testing.py
+2
-1
test/test_toolkit.py
test/test_toolkit.py
+2
-100
No files found.
DHParser/__init__.py
View file @
468e2931
...
@@ -18,6 +18,7 @@ implied. See the License for the specific language governing
...
@@ -18,6 +18,7 @@ implied. See the License for the specific language governing
permissions and limitations under the License.
permissions and limitations under the License.
"""
"""
from
.base
import
*
from
.dsl
import
*
from
.dsl
import
*
from
.ebnf
import
*
from
.ebnf
import
*
from
.parser
import
*
from
.parser
import
*
...
@@ -30,4 +31,4 @@ from .versionnumber import __version__
...
@@ -30,4 +31,4 @@ from .versionnumber import __version__
__author__
=
"Eckhart Arnold <arnold@badw.de>"
__author__
=
"Eckhart Arnold <arnold@badw.de>"
__copyright__
=
"http://www.apache.org/licenses/LICENSE-2.0"
__copyright__
=
"http://www.apache.org/licenses/LICENSE-2.0"
# __all__ = ['toolkit', 'syntaxtree', 'parser', 'transform', 'ebnf', 'dsl', 'testing', 'versionnumber'] # flat namespace
# __all__ = ['toolkit', '
base', '
syntaxtree', 'parser', 'transform', 'ebnf', 'dsl', 'testing', 'versionnumber'] # flat namespace
DHParser/base.py
0 → 100644
View file @
468e2931
"""base.py - various base classes that are used across several other
the DHParser-modules.
Copyright 2016 by Eckhart Arnold (arnold@badw.de)
Bavarian Academy of Sciences an Humanities (badw.de)
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
implied. See the License for the specific language governing
permissions and limitations under the License.
"""
import
collections
from
typing
import
Hashable
,
Iterable
,
Iterator
,
Optional
,
Tuple
__all__
=
(
'ParserBase'
,
'WHITESPACE_PTYPE'
,
'TOKEN_PTYPE'
,
'MockParser'
,
'ZombieParser'
,
'ZOMBIE_PARSER'
,
'Error'
,
'is_error'
,
'is_warning'
,
'has_errors'
,
'only_errors'
,
'StringView'
,
'EMPTY_STRING_VIEW'
)
#######################################################################
#
# parser base and mock parsers
#
#######################################################################
class
ParserBase
:
"""
ParserBase is the base class for all real and mock parser classes.
It is defined here, because Node objects require a parser object
for instantiation.
"""
def
__init__
(
self
,
name
=
''
):
# , pbases=frozenset()):
self
.
name
=
name
# type: str
self
.
_ptype
=
':'
+
self
.
__class__
.
__name__
# type: str
def
__repr__
(
self
):
return
self
.
name
+
self
.
ptype
def
__str__
(
self
):
return
self
.
name
+
(
' = '
if
self
.
name
else
''
)
+
repr
(
self
)
@
property
def
ptype
(
self
)
->
str
:
return
self
.
_ptype
@
property
def
repr
(
self
)
->
str
:
return
self
.
name
if
self
.
name
else
repr
(
self
)
WHITESPACE_PTYPE
=
':Whitespace'
TOKEN_PTYPE
=
':Token'
class
MockParser
(
ParserBase
):
"""
MockParser objects can be used to reconstruct syntax trees from a
serialized form like S-expressions or XML. Mock objects can mimic
different parser types by assigning them a ptype on initialization.
Mock objects should not be used for anything other than
syntax tree (re-)construction. In all other cases where a parser
object substitute is needed, chose the singleton ZOMBIE_PARSER.
"""
def
__init__
(
self
,
name
=
''
,
ptype
=
''
):
# , pbases=frozenset()):
assert
not
ptype
or
ptype
[
0
]
==
':'
super
(
MockParser
,
self
).
__init__
(
name
)
self
.
name
=
name
self
.
_ptype
=
ptype
or
':'
+
self
.
__class__
.
__name__
class
ZombieParser
(
MockParser
):
"""
Serves as a substitute for a Parser instance.
``ZombieParser`` is the class of the singelton object
``ZOMBIE_PARSER``. The ``ZOMBIE_PARSER`` has a name and can be
called, but it never matches. It serves as a substitute where only
these (or one of these properties) is needed, but no real Parser-
object is instantiated.
"""
alive
=
False
def
__init__
(
self
):
super
(
ZombieParser
,
self
).
__init__
(
"__ZOMBIE__"
)
assert
not
self
.
__class__
.
alive
,
"There can be only one!"
assert
self
.
__class__
==
ZombieParser
,
"No derivatives, please!"
self
.
__class__
.
alive
=
True
def
__copy__
(
self
):
return
self
def
__deepcopy__
(
self
,
memo
):
return
self
def
__call__
(
self
,
text
):
"""Better call Saul ;-)"""
return
None
,
text
ZOMBIE_PARSER
=
ZombieParser
()
#######################################################################
#
# error reporting
#
#######################################################################
class
Error
:
__slots__
=
[
'message'
,
'level'
,
'code'
,
'pos'
,
'line'
,
'column'
]
WARNING
=
1
ERROR
=
1000
HIGHEST
=
ERROR
def
__init__
(
self
,
message
:
str
,
level
:
int
=
ERROR
,
code
:
Hashable
=
0
):
self
.
message
=
message
assert
level
>=
0
self
.
level
=
level
or
Error
.
ERROR
self
.
code
=
code
self
.
pos
=
-
1
self
.
line
=
-
1
self
.
column
=
-
1
def
__str__
(
self
):
prefix
=
''
if
self
.
line
>
0
:
prefix
=
"line: %3i, column: %2i, "
%
(
self
.
line
,
self
.
column
)
return
prefix
+
"%s: %s"
%
(
self
.
level_str
,
self
.
message
)
@
property
def
level_str
(
self
):
return
"Warning"
if
is_warning
(
self
.
level
)
else
"Error"
def
is_warning
(
level
:
int
)
->
bool
:
return
level
<
Error
.
ERROR
def
is_error
(
level
:
int
)
->
bool
:
return
level
>=
Error
.
ERROR
def
has_errors
(
messages
:
Iterable
[
Error
],
level
:
int
=
Error
.
ERROR
)
->
bool
:
"""
Returns True, if at least one entry in `messages` has at
least the given error `level`.
"""
for
err_obj
in
messages
:
if
err_obj
.
level
>=
level
:
return
True
return
False
def
only_errors
(
messages
:
Iterable
[
Error
],
level
:
int
=
Error
.
ERROR
)
->
Iterator
[
Error
]:
"""
Returns an Iterator that yields only those messages that have
at least the given error level.
"""
return
(
err
for
err
in
messages
if
err
.
level
>=
level
)
#######################################################################
#
# string view
#
#######################################################################
class
StringView
(
collections
.
abc
.
Sized
):
""""A rudimentary StringView class, just enough for the use cases
in parser.py.
Slicing Python-strings always yields copies of a segment of the original
string. See: https://mail.python.org/pipermail/python-dev/2008-May/079699.html
However, this becomes costly (in terms of space and as a consequence also
time) when parsing longer documents. Unfortunately, Python's `memoryview`
does not work for unicode strings. Hence, the StringView class.
"""
__slots__
=
[
'text'
,
'begin'
,
'end'
,
'len'
,
'fullstring_flag'
]
def
__init__
(
self
,
text
:
str
,
begin
:
Optional
[
int
]
=
0
,
end
:
Optional
[
int
]
=
None
)
->
None
:
self
.
text
=
text
# type: str
self
.
begin
=
0
# type: int
self
.
end
=
0
# type: int
self
.
begin
,
self
.
end
=
StringView
.
real_indices
(
begin
,
end
,
len
(
text
))
self
.
len
=
max
(
self
.
end
-
self
.
begin
,
0
)
self
.
fullstring_flag
=
(
self
.
begin
==
0
and
self
.
len
==
len
(
self
.
text
))
@
staticmethod
def
real_indices
(
begin
,
end
,
len
):
def
pack
(
index
,
len
):
index
=
index
if
index
>=
0
else
index
+
len
return
0
if
index
<
0
else
len
if
index
>
len
else
index
if
begin
is
None
:
begin
=
0
if
end
is
None
:
end
=
len
return
pack
(
begin
,
len
),
pack
(
end
,
len
)
def
__bool__
(
self
):
return
bool
(
self
.
text
)
and
self
.
end
>
self
.
begin
def
__len__
(
self
):
return
self
.
len
def
__str__
(
self
):
if
self
.
fullstring_flag
:
# optimization: avoid slicing/copying
return
self
.
text
return
self
.
text
[
self
.
begin
:
self
.
end
]
def
__getitem__
(
self
,
index
):
# assert isinstance(index, slice), "As of now, StringView only allows slicing."
# assert index.step is None or index.step == 1, \
# "Step sizes other than 1 are not yet supported by StringView"
start
,
stop
=
StringView
.
real_indices
(
index
.
start
,
index
.
stop
,
self
.
len
)
return
StringView
(
self
.
text
,
self
.
begin
+
start
,
self
.
begin
+
stop
)
def
__eq__
(
self
,
other
):
return
str
(
self
)
==
str
(
other
)
# PERFORMANCE WARNING: This creates copies of the strings
def
count
(
self
,
sub
,
start
=
None
,
end
=
None
)
->
int
:
if
self
.
fullstring_flag
:
return
self
.
text
.
count
(
sub
,
start
,
end
)
elif
start
is
None
and
end
is
None
:
return
self
.
text
.
count
(
sub
,
self
.
begin
,
self
.
end
)
else
:
start
,
end
=
StringView
.
real_indices
(
start
,
end
,
self
.
len
)
return
self
.
text
.
count
(
sub
,
self
.
begin
+
start
,
self
.
begin
+
end
)
def
find
(
self
,
sub
,
start
=
None
,
end
=
None
)
->
int
:
if
self
.
fullstring_flag
:
return
self
.
text
.
find
(
sub
,
start
,
end
)
elif
start
is
None
and
end
is
None
:
return
self
.
text
.
find
(
sub
,
self
.
begin
,
self
.
end
)
-
self
.
begin
else
:
start
,
end
=
StringView
.
real_indices
(
start
,
end
,
self
.
len
)
return
self
.
text
.
find
(
sub
,
self
.
begin
+
start
,
self
.
begin
+
end
)
-
self
.
begin
def
rfind
(
self
,
sub
,
start
=
None
,
end
=
None
)
->
int
:
if
self
.
fullstring_flag
:
return
self
.
text
.
rfind
(
sub
,
start
,
end
)
if
start
is
None
and
end
is
None
:
return
self
.
text
.
rfind
(
sub
,
self
.
begin
,
self
.
end
)
-
self
.
begin
else
:
start
,
end
=
StringView
.
real_indices
(
start
,
end
,
self
.
len
)
return
self
.
text
.
rfind
(
sub
,
self
.
begin
+
start
,
self
.
begin
+
end
)
-
self
.
begin
def
startswith
(
self
,
prefix
:
str
,
start
:
int
=
0
,
end
:
Optional
[
int
]
=
None
)
->
bool
:
start
+=
self
.
begin
end
=
self
.
end
if
end
is
None
else
self
.
begin
+
end
return
self
.
text
.
startswith
(
prefix
,
start
,
end
)
def
match
(
self
,
regex
):
return
regex
.
match
(
self
.
text
,
pos
=
self
.
begin
,
endpos
=
self
.
end
)
def
index
(
self
,
absolute_index
:
int
)
->
int
:
"""
Converts an index for a string watched by a StringView object
to an index relative to the string view object, e.g.:
>>> sv = StringView('xxIxx')[2:3]
>>> match = sv.match(re.compile('I'))
>>> match.end()
3
>>> sv.index(match.end())
1
"""
return
absolute_index
-
self
.
begin
def
indices
(
self
,
absolute_indices
:
Iterable
[
int
])
->
Tuple
[
int
,
...]:
"""Converts indices for a string watched by a StringView object
to indices relative to the string view object. See also: `sv_index()`
"""
return
tuple
(
index
-
self
.
begin
for
index
in
absolute_indices
)
def
search
(
self
,
regex
):
return
regex
.
search
(
self
.
text
,
pos
=
self
.
begin
,
endpos
=
self
.
end
)
EMPTY_STRING_VIEW
=
StringView
(
''
)
\ No newline at end of file
DHParser/dsl.py
View file @
468e2931
...
@@ -15,7 +15,7 @@ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
...
@@ -15,7 +15,7 @@ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
implied. See the License for the specific language governing
implied. See the License for the specific language governing
permissions and limitations under the License.
permissions and limitations under the License.
Module ``
DSLsupport
`` contains various functions to support the
Module ``
dsl
`` contains various functions to support the
compilation of domain specific languages based on an EBNF-grammar.
compilation of domain specific languages based on an EBNF-grammar.
"""
"""
...
@@ -35,7 +35,8 @@ from DHParser.ebnf import EBNFCompiler, grammar_changed, \
...
@@ -35,7 +35,8 @@ from DHParser.ebnf import EBNFCompiler, grammar_changed, \
PreprocessorFactoryFunc
,
ParserFactoryFunc
,
TransformerFactoryFunc
,
CompilerFactoryFunc
PreprocessorFactoryFunc
,
ParserFactoryFunc
,
TransformerFactoryFunc
,
CompilerFactoryFunc
from
DHParser.toolkit
import
logging
,
load_if_file
,
is_python_code
,
compile_python_object
from
DHParser.toolkit
import
logging
,
load_if_file
,
is_python_code
,
compile_python_object
from
DHParser.parser
import
Grammar
,
Compiler
,
compile_source
,
nil_preprocessor
,
PreprocessorFunc
from
DHParser.parser
import
Grammar
,
Compiler
,
compile_source
,
nil_preprocessor
,
PreprocessorFunc
from
DHParser.syntaxtree
import
Error
,
is_error
,
has_errors
,
only_errors
,
Node
,
TransformationFunc
from
DHParser.syntaxtree
import
Node
,
TransformationFunc
from
DHParser.base
import
Error
,
is_error
,
has_errors
,
only_errors
__all__
=
(
'GrammarError'
,
__all__
=
(
'GrammarError'
,
'CompilationError'
,
'CompilationError'
,
...
...
DHParser/ebnf.py
View file @
468e2931
...
@@ -33,7 +33,8 @@ from DHParser.toolkit import load_if_file, escape_re, md5, sane_parser_name
...
@@ -33,7 +33,8 @@ from DHParser.toolkit import load_if_file, escape_re, md5, sane_parser_name
from
DHParser.parser
import
Grammar
,
mixin_comment
,
nil_preprocessor
,
Forward
,
RE
,
NegativeLookahead
,
\
from
DHParser.parser
import
Grammar
,
mixin_comment
,
nil_preprocessor
,
Forward
,
RE
,
NegativeLookahead
,
\
Alternative
,
Series
,
Option
,
Required
,
OneOrMore
,
ZeroOrMore
,
Token
,
Compiler
,
\
Alternative
,
Series
,
Option
,
Required
,
OneOrMore
,
ZeroOrMore
,
Token
,
Compiler
,
\
PreprocessorFunc
PreprocessorFunc
from
DHParser.syntaxtree
import
WHITESPACE_PTYPE
,
TOKEN_PTYPE
,
Error
,
Node
,
TransformationFunc
from
DHParser.syntaxtree
import
Node
,
TransformationFunc
from
DHParser.base
import
WHITESPACE_PTYPE
,
TOKEN_PTYPE
,
Error
from
DHParser.transform
import
TransformationDict
,
traverse
,
remove_brackets
,
\
from
DHParser.transform
import
TransformationDict
,
traverse
,
remove_brackets
,
\
reduce_single_child
,
replace_by_single_child
,
remove_expendables
,
\
reduce_single_child
,
replace_by_single_child
,
remove_expendables
,
\
remove_tokens
,
flatten
,
forbid
,
assert_content
,
remove_infix_operator
remove_tokens
,
flatten
,
forbid
,
assert_content
,
remove_infix_operator
...
...
DHParser/parser.py
View file @
468e2931
...
@@ -75,10 +75,10 @@ except ImportError:
...
@@ -75,10 +75,10 @@ except ImportError:
from
.typing34
import
Any
,
Callable
,
cast
,
Dict
,
Iterator
,
List
,
Set
,
Tuple
,
Union
,
Optional
from
.typing34
import
Any
,
Callable
,
cast
,
Dict
,
Iterator
,
List
,
Set
,
Tuple
,
Union
,
Optional
from
DHParser.toolkit
import
is_logging
,
log_dir
,
logfile_basename
,
escape_re
,
sane_parser_name
from
DHParser.toolkit
import
is_logging
,
log_dir
,
logfile_basename
,
escape_re
,
sane_parser_name
from
DHParser.syntaxtree
import
WHITESPACE_PTYPE
,
TOKEN_PTYPE
,
ZOMBIE_PARSER
,
ParserBase
,
\
from
DHParser.syntaxtree
import
Node
,
TransformationFunc
Error
,
is_error
,
has_errors
,
Node
,
TransformationFunc
from
DHParser.base
import
ParserBase
,
WHITESPACE_PTYPE
,
TOKEN_PTYPE
,
ZOMBIE_PARSER
,
Error
,
is_error
,
has_errors
,
\
from
DHParser.toolkit
import
StringView
,
EMPTY_STRING_VIEW
,
sv_match
,
sv_index
,
sv_search
,
\
StringView
,
EMPTY_STRING_VIEW
load_if_file
,
error_messages
,
line_col
from
DHParser.toolkit
import
load_if_file
,
error_messages
,
line_col
__all__
=
(
'PreprocessorFunc'
,
__all__
=
(
'PreprocessorFunc'
,
'HistoryRecord'
,
'HistoryRecord'
,
...
@@ -1066,9 +1066,9 @@ class RegExp(Parser):
...
@@ -1066,9 +1066,9 @@ class RegExp(Parser):
return
RegExp
(
regexp
,
self
.
name
)
return
RegExp
(
regexp
,
self
.
name
)
def
__call__
(
self
,
text
:
StringView
)
->
Tuple
[
Node
,
StringView
]:
def
__call__
(
self
,
text
:
StringView
)
->
Tuple
[
Node
,
StringView
]:
match
=
text
[
0
:
1
]
!=
BEGIN_TOKEN
and
sv_match
(
self
.
regexp
,
text
)
# ESC starts a preprocessor token.
match
=
text
[
0
:
1
]
!=
BEGIN_TOKEN
and
text
.
match
(
self
.
regexp
)
# ESC starts a preprocessor token.
if
match
:
if
match
:
end
=
sv_index
(
match
.
end
(),
text
)
end
=
text
.
index
(
match
.
end
()
)
return
Node
(
self
,
text
[:
end
]),
text
[
end
:]
return
Node
(
self
,
text
[:
end
]),
text
[
end
:]
return
None
,
text
return
None
,
text
...
@@ -1521,8 +1521,8 @@ class Required(FlowOperator):
...
@@ -1521,8 +1521,8 @@ class Required(FlowOperator):
def
__call__
(
self
,
text
:
StringView
)
->
Tuple
[
Node
,
StringView
]:
def
__call__
(
self
,
text
:
StringView
)
->
Tuple
[
Node
,
StringView
]:
node
,
text_
=
self
.
parser
(
text
)
node
,
text_
=
self
.
parser
(
text
)
if
not
node
:
if
not
node
:
m
=
sv_search
(
Required
.
RX_ARGUMENT
,
text
)
# re.search(r'\s(\S)', text)
m
=
text
.
search
(
Required
.
RX_ARGUMENT
)
# re.search(r'\s(\S)', text)
i
=
max
(
1
,
sv_index
(
m
.
regs
[
1
][
0
],
text
))
if
m
else
1
i
=
max
(
1
,
text
.
index
(
m
.
regs
[
1
][
0
]
))
if
m
else
1
node
=
Node
(
self
,
text
[:
i
])
node
=
Node
(
self
,
text
[:
i
])
text_
=
text
[
i
:]
text_
=
text
[
i
:]
# assert False, "*"+text[:i]+"*"
# assert False, "*"+text[:i]+"*"
...
@@ -1585,7 +1585,7 @@ class Lookbehind(FlowOperator):
...
@@ -1585,7 +1585,7 @@ class Lookbehind(FlowOperator):
def
__call__
(
self
,
text
:
StringView
)
->
Tuple
[
Node
,
StringView
]:
def
__call__
(
self
,
text
:
StringView
)
->
Tuple
[
Node
,
StringView
]:
backwards_text
=
self
.
grammar
.
reversed__
[
len
(
text
):]
# self.grammar.document__[-len(text) - 1::-1]
backwards_text
=
self
.
grammar
.
reversed__
[
len
(
text
):]
# self.grammar.document__[-len(text) - 1::-1]
if
self
.
sign
(
sv_match
(
self
.
regexp
,
backwards_text
)):
if
self
.
sign
(
backwards_text
.
match
(
self
.
regexp
)):
return
Node
(
self
,
''
),
text
return
Node
(
self
,
''
),
text
else
:
else
:
return
None
,
text
return
None
,
text
...
...
DHParser/syntaxtree.py
View file @
468e2931
...
@@ -32,155 +32,14 @@ except ImportError:
...
@@ -32,155 +32,14 @@ except ImportError:
from
.typing34
import
AbstractSet
,
Any
,
ByteString
,
Callable
,
cast
,
Container
,
Dict
,
\
from
.typing34
import
AbstractSet
,
Any
,
ByteString
,
Callable
,
cast
,
Container
,
Dict
,
\
Iterator
,
Iterable
,
List
,
NamedTuple
,
Sequence
,
Union
,
Text
,
Tuple
,
Hashable
Iterator
,
Iterable
,
List
,
NamedTuple
,
Sequence
,
Union
,
Text
,
Tuple
,
Hashable
from
DHParser.toolkit
import
is_logging
,
log_dir
,
StringView
,
linebreaks
,
line_col
,
identity
from
DHParser.toolkit
import
is_logging
,
log_dir
,
linebreaks
,
line_col
,
identity
from
DHParser.base
import
MockParser
,
ZOMBIE_PARSER
,
Error
,
StringView
__all__
=
(
'WHITESPACE_PTYPE'
,
'MockParser'
,
__all__
=
(
'Node'
,
'TOKEN_PTYPE'
,
'ZOMBIE_PARSER'
,
'ParserBase'
,
'Error'
,
'is_warning'
,
'is_error'
,
'has_errors'
,
'Node'
,
'mock_syntax_tree'
,
'mock_syntax_tree'
,
'TransformationFunc'
)
'TransformationFunc'
)
class
ParserBase
:
"""
ParserBase is the base class for all real and mock parser classes.
It is defined here, because Node objects require a parser object
for instantiation.
"""
def
__init__
(
self
,
name
=
''
):
# , pbases=frozenset()):
self
.
name
=
name
# type: str
self
.
_ptype
=
':'
+
self
.
__class__
.
__name__
# type: str
def
__repr__
(
self
):
return
self
.
name
+
self
.
ptype
def
__str__
(
self
):
return
self
.
name
+
(
' = '
if
self
.
name
else
''
)
+
repr
(
self
)
@
property
def
ptype
(
self
)
->
str
:
return
self
.
_ptype
@
property
def
repr
(
self
)
->
str
:
return
self
.
name
if
self
.
name
else
repr
(
self
)
WHITESPACE_PTYPE
=
':Whitespace'
TOKEN_PTYPE
=
':Token'
class
MockParser
(
ParserBase
):
"""
MockParser objects can be used to reconstruct syntax trees from a
serialized form like S-expressions or XML. Mock objects can mimic
different parser types by assigning them a ptype on initialization.
Mock objects should not be used for anything other than
syntax tree (re-)construction. In all other cases where a parser
object substitute is needed, chose the singleton ZOMBIE_PARSER.
"""
def
__init__
(
self
,
name
=
''
,
ptype
=
''
):
# , pbases=frozenset()):
assert
not
ptype
or
ptype
[
0
]
==
':'
super
(
MockParser
,
self
).
__init__
(
name
)
self
.
name
=
name
self
.
_ptype
=
ptype
or
':'
+
self
.
__class__
.
__name__
class
ZombieParser
(
MockParser
):
"""
Serves as a substitute for a Parser instance.
``ZombieParser`` is the class of the singelton object
``ZOMBIE_PARSER``. The ``ZOMBIE_PARSER`` has a name and can be
called, but it never matches. It serves as a substitute where only
these (or one of these properties) is needed, but no real Parser-
object is instantiated.
"""
alive
=
False
def
__init__
(
self
):
super
(
ZombieParser
,
self
).
__init__
(
"__ZOMBIE__"
)
assert
not
self
.
__class__
.
alive
,
"There can be only one!"
assert
self
.
__class__
==
ZombieParser
,
"No derivatives, please!"
self
.
__class__
.
alive
=
True
def
__copy__
(
self
):
return
self
def
__deepcopy__
(
self
,
memo
):
return
self
def
__call__
(
self
,
text
):
"""Better call Saul ;-)"""
return
None
,
text
ZOMBIE_PARSER
=
ZombieParser
()
class
Error
:
__slots__
=
[
'message'
,
'level'
,
'code'
,
'pos'
,
'line'
,
'column'
]
WARNING
=
1
ERROR
=
1000
HIGHEST
=
ERROR
def
__init__
(
self
,
message
:
str
,
level
:
int
=
ERROR
,
code
:
Hashable
=
0
):
self
.
message
=
message
assert
level
>=
0
self
.
level
=
level
or
Error
.
ERROR
self
.
code
=
code
self
.
pos
=
-
1
self
.
line
=
-
1
self
.
column
=
-
1
def
__str__
(
self
):
prefix
=
''
if
self
.
line
>
0
:
prefix
=
"line: %3i, column: %2i, "
%
(
self
.
line
,
self
.
column
)
return
prefix
+
"%s: %s"
%
(
self
.
level_str
,
self
.
message
)
@
property
def
level_str
(
self
):
return
"Warning"
if
is_warning
(
self
.
level
)
else
"Error"
def
is_warning
(
level
:
int
)
->
bool
:
return
level
<
Error
.
ERROR
def
is_error
(
level
:
int
)
->
bool
:
return
level
>=
Error
.
ERROR
def
has_errors
(
messages
:
Iterable
[
Error
],
level
:
int
=
Error
.
ERROR
)
->
bool
:
"""
Returns True, if at least one entry in `messages` has at
least the given error `level`.
"""
for
err_obj
in
messages
:
if
err_obj
.
level
>=
level
:
return
True
return
False
def
only_errors
(
messages
:
Iterable
[
Error
],
level
:
int
=
Error
.
ERROR
)
->
Iterator
[
Error
]:
"""
Returns an Iterator that yields only those messages that have
at least the given error level.
"""
return
(
err
for
err
in
messages
if
err
.
level
>=
level
)
ChildrenType
=
Tuple
[
'Node'
,
...]
ChildrenType
=
Tuple
[
'Node'
,
...]
StrictResultType
=
Union
[
ChildrenType
,
StringView
,
str
]
StrictResultType
=
Union
[
ChildrenType
,
StringView
,
str
]
ResultType
=
Union
[
ChildrenType
,
'Node'
,
StringView
,
str
,
None
]
ResultType
=
Union
[
ChildrenType
,
'Node'
,
StringView
,
str
,
None
]
...
@@ -347,7 +206,7 @@ class Node(collections.abc.Sized):
...
@@ -347,7 +206,7 @@ class Node(collections.abc.Sized):
return
self
.
_errors
.
copy
()
return
self
.
_errors
.
copy
()
def
add_error
(
self
,
message
:
str
,
level
:
int
=
Error
.
ERROR
,
code
:
Hashable
=
0
)
->
'Node'
:
def
add_error
(
self
,
message
:
str
,
level
:
int
=
Error
.
ERROR
,
code
:
Hashable
=
0
)
->
'Node'
:
self
.
_errors
.
append
(
Error
(
message
,
level
,
code
))
self
.
_errors
.
append
(
Error
(
message
,
level
,
code
))
self
.
error_flag
=
max
(
self
.
error_flag
,
self
.
_errors
[
-
1
].
level
)
self
.
error_flag
=
max
(
self
.
error_flag
,
self
.
_errors
[
-
1
].
level
)
return
self
return
self
...
...