Mapytex/mapytex/calculus/core/renders/tree2txt.py

241 lines
5.9 KiB
Python
Raw Normal View History

2018-03-09 16:33:02 +00:00
#! /usr/bin/env python
# -*- coding: utf-8 -*-
# vim:fenc=utf-8
#
# Copyright © 2017 lafrite <lafrite@Poivre>
#
# Distributed under terms of the MIT license.
from mapytex.calculus.core.operator import OPERATORS
__all__ = ['tree2txt']
2018-03-10 05:03:55 +00:00
2018-03-09 16:33:02 +00:00
def plus2txt(left, right):
""" + rendering
>>> from ..MO import mo
2018-03-10 05:03:55 +00:00
>>> plus2txt(mo.MOnumber(2), mo.MOnumber(3))
2018-03-09 16:33:02 +00:00
'2 + 3'
>>> from ..tree import Tree
2018-03-09 16:33:02 +00:00
>>> t = Tree.from_str("1+2")
2018-03-10 05:03:55 +00:00
>>> plus2txt(t, mo.MOnumber(3))
2018-03-09 16:33:02 +00:00
'1 + 2 + 3'
2018-03-10 05:03:55 +00:00
>>> plus2txt(t, mo.MOnumber(-3))
'1 + 2 - 3'
>>> plus2txt(mo.MOnumber(-3), t)
'- 3 + 1 + 2'
>>> t = Tree.from_str("-2*3")
>>> plus2txt(mo.MOnumber(3), t)
'3 - 2 * 3'
2018-03-09 16:33:02 +00:00
"""
2018-03-10 05:03:55 +00:00
display_plus = True
2018-03-09 16:33:02 +00:00
try:
left.node
except AttributeError:
left_ = left.__txt__
else:
left_ = tree2txt(left)
2018-03-10 05:03:55 +00:00
2018-03-09 16:33:02 +00:00
try:
right.node
except AttributeError:
right_ = right.__txt__
else:
right_ = tree2txt(right)
2018-03-10 05:03:55 +00:00
finally:
if right_.startswith("-"):
display_plus = False
2018-03-09 16:33:02 +00:00
2018-03-10 05:03:55 +00:00
if display_plus:
return f"{left_} + {right_}"
2018-03-09 16:33:02 +00:00
2018-03-10 05:03:55 +00:00
return f"{left_} {right_}"
2018-03-09 16:33:02 +00:00
def minus2txt(left, right):
2018-03-10 05:03:55 +00:00
""" - rendering
>>> from ..MO import mo
2018-03-10 05:03:55 +00:00
>>> minus2txt(None, mo.MO(3))
'- 3'
>>> from ..tree import Tree
2018-03-10 05:03:55 +00:00
>>> t = Tree.from_str("1+2")
>>> minus2txt(None, t)
'- (1 + 2)'
"""
try:
right_need_parenthesis = False
if OPERATORS[right.node]["precedence"] < OPERATORS['-']["precedence"]:
right_need_parenthesis = True
except AttributeError:
right_ = right.__txt__
else:
if right_need_parenthesis:
right_ = f"({tree2txt(right)})"
else:
right_ = tree2txt(right)
return f"- {right_}"
2018-03-09 16:33:02 +00:00
def mul2txt(left, right):
2018-03-10 05:03:55 +00:00
""" * rendering
>>> from ..MO import mo
2018-03-10 05:03:55 +00:00
>>> mul2txt(mo.MO(2), mo.MO(3))
'2 * 3'
>>> from ..tree import Tree
2018-03-10 05:03:55 +00:00
>>> t = Tree.from_str("1*2")
>>> mul2txt(t, mo.MO(3))
'1 * 2 * 3'
>>> t = Tree.from_str("1+2")
>>> mul2txt(t, mo.MO(3))
'(1 + 2) * 3'
>>> mul2txt(mo.MO(3), t)
'3(1 + 2)'
>>> a = mo.MOstr('x')
>>> mul2txt(mo.MO(3), a)
'3x'
"""
display_time = True
try:
left_need_parenthesis = False
if OPERATORS[left.node]["precedence"] < OPERATORS['*']["precedence"]:
left_need_parenthesis = True
except AttributeError:
left_ = left.__txt__
else:
if left_need_parenthesis:
left_ = f"({tree2txt(left)})"
else:
left_ = tree2txt(left)
try:
right_need_parenthesis = False
if OPERATORS[right.node]["precedence"] < OPERATORS['*']["precedence"]:
right_need_parenthesis = True
except AttributeError:
right_ = right.__txt__
else:
if right_need_parenthesis:
display_time = False
right_ = f"({tree2txt(right)})"
else:
right_ = tree2txt(right)
finally:
if right_[0].isalpha():
display_time = False
if display_time:
return f"{left_} * {right_}"
else:
return f"{left_}{right_}"
2018-03-09 16:33:02 +00:00
def div2txt(left, right):
2018-03-10 05:03:55 +00:00
""" / rendering
>>> from ..MO import mo
2018-03-10 05:03:55 +00:00
>>> div2txt(mo.MO(2), mo.MO(3))
'2 / 3'
>>> from ..tree import Tree
2018-03-10 05:03:55 +00:00
>>> t = Tree.from_str("1/2")
>>> div2txt(t, mo.MO(3))
'1 / 2 / 3'
>>> t = Tree.from_str("1+2")
>>> div2txt(t, mo.MO(3))
'(1 + 2) / 3'
>>> t = Tree.from_str("1*2")
>>> div2txt(mo.MO(3), t)
'3 / (1 * 2)'
"""
try:
left_need_parenthesis = False
if OPERATORS[left.node]["precedence"] < OPERATORS['/']["precedence"]:
left_need_parenthesis = True
except AttributeError:
left_ = left.__txt__
else:
if left_need_parenthesis:
left_ = f"({tree2txt(left)})"
else:
left_ = tree2txt(left)
try:
right_need_parenthesis = False
if OPERATORS[right.node]["precedence"] < OPERATORS['/']["precedence"]:
right_need_parenthesis = True
except AttributeError:
right_ = right.__txt__
else:
if right_need_parenthesis:
right_ = f"({tree2txt(right)})"
else:
right_ = tree2txt(right)
return f"{left_} / {right_}"
2018-03-09 16:33:02 +00:00
def pow2txt(left, right):
2018-03-10 05:03:55 +00:00
""" ^ rendering
>>> from ..MO import mo
2018-03-10 05:03:55 +00:00
>>> pow2txt(mo.MO(2), mo.MO(3))
'2 ^ 3'
>>> from ..tree import Tree
2018-03-10 05:03:55 +00:00
>>> t = Tree.from_str("1^2")
>>> pow2txt(t, mo.MO(3))
'1 ^ 2 ^ 3'
>>> t = Tree.from_str("1+2")
>>> pow2txt(t, mo.MO(3))
'(1 + 2) ^ 3'
>>> t = Tree.from_str("1*2")
>>> pow2txt(mo.MO(3), t)
'3 ^ (1 * 2)'
"""
try:
left_need_parenthesis = False
if OPERATORS[left.node]["precedence"] < OPERATORS['^']["precedence"]:
left_need_parenthesis = True
except AttributeError:
left_ = left.__txt__
else:
if left_need_parenthesis:
left_ = f"({tree2txt(left)})"
else:
left_ = tree2txt(left)
try:
right_need_parenthesis = False
if OPERATORS[right.node]["precedence"] < OPERATORS['^']["precedence"]:
right_need_parenthesis = True
except AttributeError:
right_ = right.__txt__
else:
if right_need_parenthesis:
right_ = f"({tree2txt(right)})"
else:
right_ = tree2txt(right)
return f"{left_} ^ {right_}"
2018-03-09 16:33:02 +00:00
OPERATOR2TXT = {
"+": plus2txt,
"-": minus2txt,
"*": mul2txt,
"/": div2txt,
"^": pow2txt,
}
def tree2txt(tree):
""" Convert a tree into its txt version
It calls __txt__ to render MOs.
>>> from ..tree import Tree
2018-03-09 16:33:02 +00:00
>>> t = Tree.from_str("2+3*4")
>>> tree2txt(t)
2018-03-10 05:03:55 +00:00
'2 + 3 * 4'
2018-03-09 16:33:02 +00:00
"""
return OPERATOR2TXT[tree.node](tree.left_value, tree.right_value)
# -----------------------------
# Reglages pour 'vim'
# vim:set autoindent expandtab tabstop=4 shiftwidth=4:
# cursor: 16 del