Parse a Python-like language
Project description
PLLParser
Parse a Python-like language
This package includes the following modules:
TreeNode.py
SYNOPSIS
node = TreeNode('menubar')
# --- A node can be used like a dictionary
# It will, by default, have a key 'label' set
# to the string provided
print(node['label'])
# menubar
node['mykey'] = 'myvalue'
print(f"node has {len(node)} keys")
# node has 2 keys
firstChild = TreeNode('firstchild')
node.appendChildNode(firstChild)
secondChild = TreeNode('secondchild')
node.appendChildNode(secondChild)
thirdChild = TreeNode('thirdchild')
node.appendChildNode(secondChild)
print(f"node has {node.numChildren()} children")
# node has 3 children
print(f"node has {node.numSiblings()} siblings")
print(f"firstChild has {firstChild.numSiblings()} siblings")
# node has 0 siblings
# firstChild has 2 siblings
RETokenizer.py
SYNOPSIS
tokzr = RETokenizer()
tokzr.add('INTEGER', r'\d+')
tokzr.add('STRING', r'"([^"]*)"', 1)
tokzr.add('STRING', r"'([^']*)'", 1)
lTokens = list(tokzr.tokens('"mystring"'
' + '
"'other'"))
assert lTokens == [
('STRING', 'mystring'),
('OTHER', '+'),
('STRING', 'other'),
]
PLLParser.py
SYNOPSIS
s = '''
* menubar
file
new
open
edit
undo
* layout
row
EditField
SelectField
'''
(tree, hSubTrees) = parsePLL(s)
assert len(hSubTrees) == 2
parserUtils.py
SYNOPSIS
See the file
Unit Tests
All unit tests appear at the end of the source file itself
They can be run using pytest
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
PLLParser-0.3.3.tar.gz
(12.5 kB
view hashes)
Built Distribution
PLLParser-0.3.3-py3-none-any.whl
(14.9 kB
view hashes)
Close
Hashes for PLLParser-0.3.3-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 52b1947dcae7c9eee6c1ab4158003969b6cab82bde7543f4b50aacaf6c7acf33 |
|
MD5 | ecbc2aeb24789f08c72c46d3762862d3 |
|
BLAKE2b-256 | aa53fdb2ab31e6678b7a2c741e7caa32c600c860c51d8e1d784237e6fb0c86b0 |