ast2ast 2

docs/source/howitworks.rst

@@ -2,7 +2,8 @@ How it works
 ============
 
 In order to translate python code to quantum circuit, qlasskit performs several transformations;
-it starts from the python *AST* (abstract synthax tree) creating *boolean expressions* as intermediate
+it starts from the python *AST* (abstract synthax tree) rewriting it to a simplified version. 
+Then the simplified *AST* is translated to *boolean expressions* as intermediate
 form. Then these boolean expressions are compiled into a *quantum circuit*.
 
 While other existing libraries translate individual operations into quantum circuits and then 

docs/source/supported.rst

@@ -102,6 +102,17 @@ Comparators
    a > b or b <= c
 
 
+Function call
+^^^^^^^^^^^^^
+
+Bultin functions:
+- `print()`: debug function, ignore by conversion
+- `len(Tuple)`: returns the length of a tuple
+- `max(a, b, ...)`, `max(Tuple)`: returns the max of a tuple
+- `min(a, b, ...)`, `min(Tuple)`: returns the min of a tuple
+.. - `sum(Tuple)`: returns the sum of the elemnts of a tuple
+.. - `all(a, b, ...)`, `all(Tuple)`:
+
 
 
 Statements 

qlasskit/__init__.py

@@ -17,6 +17,7 @@
 
 from .qcircuit import QCircuit  # noqa: F401
 from .qlassf import QlassF, qlassf  # noqa: F401
+from .ast2ast import ast2ast  # noqa: F401
 from .ast2logic import exceptions  # noqa: F401
 from .types import (  # noqa: F401, F403
     const_to_qtype,