Parser and syntax tree for TLA+, the temporal logic of actions.
Project description
About
A parser for the Temporal Logic of Actions (TLA+). The parser
is based on the LR(1) algorithm
with state merging, and has time complexity linear
in the size of the input. The lexer and parser are generated using
parstools.
The syntax tree is represented as named-tuples, using
typing.NamedTuple.
To install:
pip install tla
To parse a string:
import tla
module_text = r'''
---- MODULE name ----
operator == TRUE
====================
'''
tree = tla.parse(module_text)
print(tree)
text = tla.pformat_ast(tree)
print(text)
More examples can be found in the directory examples/.
To implement a new translator of TLA+, as example the
module tla._pprint can be used.
Documentation
In the Markdown file doc.md.
Tests
Use pytest. Run with:
cd tests/
pytest -v --continue-on-collection-errors .
Read also the file tests/README.md.
License
BSD-3, read LICENSE file.
