Upload folder using huggingface_hub

.gitattributes

@@ -33,3 +33,5 @@ saved_model/**/* filter=lfs diff=lfs merge=lfs -text
 *.zip filter=lfs diff=lfs merge=lfs -text
 *.zst filter=lfs diff=lfs merge=lfs -text
 *tfevents* filter=lfs diff=lfs merge=lfs -text
+latex2sympy/antlr-4.11.1-complete.jar filter=lfs diff=lfs merge=lfs -text
+math500_accuracy_vs_length.png filter=lfs diff=lfs merge=lfs -text

.gitignore

@@ -0,0 +1,185 @@
+# Byte-compiled / optimized / DLL files
+__pycache__/
+*.py[cod]
+*$py.class
+
+# C extensions
+*.so
+
+# Distribution / packaging
+.Python
+build/
+develop-eggs/
+dist/
+downloads/
+eggs/
+.eggs/
+lib/
+lib64/
+parts/
+sdist/
+var/
+wheels/
+share/python-wheels/
+*.egg-info/
+.installed.cfg
+*.egg
+MANIFEST
+
+# PyInstaller
+#  Usually these files are written by a python script from a template
+#  before PyInstaller builds the exe, so as to inject date/other infos into it.
+*.manifest
+*.spec
+
+# Installer logs
+pip-log.txt
+pip-delete-this-directory.txt
+
+# Unit test / coverage reports
+htmlcov/
+.tox/
+.nox/
+.coverage
+.coverage.*
+.cache
+nosetests.xml
+coverage.xml
+*.cover
+*.py,cover
+.hypothesis/
+.pytest_cache/
+cover/
+
+# Translations
+*.mo
+*.pot
+
+# Django stuff:
+*.log
+local_settings.py
+db.sqlite3
+db.sqlite3-journal
+
+# Flask stuff:
+instance/
+.webassets-cache
+
+# Scrapy stuff:
+.scrapy
+
+# Sphinx documentation
+docs/_build/
+
+# PyBuilder
+.pybuilder/
+target/
+
+# Jupyter Notebook
+.ipynb_checkpoints
+
+# IPython
+profile_default/
+ipython_config.py
+
+# pyenv
+#   For a library or package, you might want to ignore these files since the code is
+#   intended to run in multiple environments; otherwise, check them in:
+# .python-version
+
+# pipenv
+#   According to pypa/pipenv#598, it is recommended to include Pipfile.lock in version control.
+#   However, in case of collaboration, if having platform-specific dependencies or dependencies
+#   having no cross-platform support, pipenv may install dependencies that don't work, or not
+#   install all needed dependencies.
+#Pipfile.lock
+
+# UV
+#   Similar to Pipfile.lock, it is generally recommended to include uv.lock in version control.
+#   This is especially recommended for binary packages to ensure reproducibility, and is more
+#   commonly ignored for libraries.
+#uv.lock
+
+# poetry
+#   Similar to Pipfile.lock, it is generally recommended to include poetry.lock in version control.
+#   This is especially recommended for binary packages to ensure reproducibility, and is more
+#   commonly ignored for libraries.
+#   https://python-poetry.org/docs/basic-usage/#commit-your-poetrylock-file-to-version-control
+#poetry.lock
+
+# pdm
+#   Similar to Pipfile.lock, it is generally recommended to include pdm.lock in version control.
+#pdm.lock
+#   pdm stores project-wide configurations in .pdm.toml, but it is recommended to not include it
+#   in version control.
+#   https://pdm.fming.dev/latest/usage/project/#working-with-version-control
+.pdm.toml
+.pdm-python
+.pdm-build/
+
+# PEP 582; used by e.g. github.com/David-OConnor/pyflow and github.com/pdm-project/pdm
+__pypackages__/
+
+# Celery stuff
+celerybeat-schedule
+celerybeat.pid
+
+# SageMath parsed files
+*.sage.py
+
+# Environments
+.env
+.venv
+env/
+venv/
+ENV/
+env.bak/
+venv.bak/
+
+# Spyder project settings
+.spyderproject
+.spyproject
+
+# Rope project settings
+.ropeproject
+
+# mkdocs documentation
+/site
+
+# mypy
+.mypy_cache/
+.dmypy.json
+dmypy.json
+
+# Pyre type checker
+.pyre/
+
+# pytype static type analyzer
+.pytype/
+
+# Cython debug symbols
+cython_debug/
+
+# PyCharm
+#  JetBrains specific template is maintained in a separate JetBrains.gitignore that can
+#  be found at https://github.com/github/gitignore/blob/main/Global/JetBrains.gitignore
+#  and can be added to the global gitignore or merged into this file.  For a more nuclear
+#  option (not recommended) you can uncomment the following to ignore the entire idea folder.
+#.idea/
+
+# PyPI configuration file
+.pypirc
+
+# outputs
+outputs/
+checkpoints/
+wandb/
+tensorboard_log/
+*.jsonl
+trained/
+training/
+*.log
+MODEL-*/
+wrong_model/*
+MODEL*/
+MODEL**/

Chain_Of_Thought_Metric/length_of_answer.py

@@ -0,0 +1,146 @@
+import os
+import re
+from transformers import AutoTokenizer
+import json
+import matplotlib.pyplot as plt
+
+# 父文件夹路径
+parent_folder = "/mnt/lyc/wuxinrui/Qwen2.5-Math/evaluation"
+pattern = re.compile(r"MODEL-.*-TIP-.*-STAGE-add-DATA-.*")
+
+entry_list = []
+setting_names = []
+# tokenizer = AutoTokenizer.from_pretrained("Qwen/Qwen1.5-1.8B", trust_remote_code=True)  # 使用合适的tokenizer
+tokenizer = AutoTokenizer.from_pretrained("/mnt/lyc/wuxinrui/LLaMA-Factory/TCMv4_8ratio/1_5B_TCMv4_8ratio_models/models", trust_remote_code=True)
+
+def calculate_token_length(text):
+    """计算文本的token长度"""
+    tokens = tokenizer(text)['input_ids']
+    return len(tokens)
+
+if __name__ == "__main__":
+    for folder in os.listdir(parent_folder):
+        # if pattern.match(folder):
+        if folder == "MODEL-7B_TCMv4_8ratio_v1_global_step_180-TIP-8ratio-STAGE-2-DATA-math500":
+            entry_list.append(os.path.join(parent_folder, folder))
+            setting_names.append(folder)
+
+    for entry, setting_name in zip(entry_list, setting_names):
+        token_length_metrics = []
+        final_answer_metrics = []
+        
+        for sub_entry in os.listdir(entry):
+            if not os.path.isdir(os.path.join(entry, sub_entry)):
+                continue
+                
+            for root, dirs, files in os.walk(os.path.join(entry, sub_entry)):
+                for file in files:
+                    if "metrics" in file:
+                        continue
+                        
+                    cot_answer_path = os.path.join(root, file)
+                    
+                    with open(cot_answer_path, "r") as f:
+                        token_length_data = {}
+                        final_answer_data = {}
+                        budget_length = int(sub_entry)
+                        token_length_data['budget_length'] = budget_length
+                        final_answer_data['budget_length'] = budget_length
+                        total_tokens = 0
+                        answer_count = 0
+                        single_final_answer_count = 0
+                        multiple_final_answer_count = 0
+                        total_delta_length = 0  # 新增：总长度差
+                        valid_delta_count = 0   # 新增：有效计数（长度小于budget的）
+                        
+                        for line in f:
+                            data = json.loads(line)
+                            answer_text = data['code'][0]
+                            token_length = calculate_token_length(answer_text)
+                            total_tokens += token_length
+                            answer_count += 1
+                            
+                            # 计算delta_length（新增部分）
+                            if token_length < budget_length:
+                                delta = budget_length - token_length
+                                total_delta_length += delta
+                                valid_delta_count += 1
+                            
+                            # 判断 **Final Answer** 的数量
+                            first_match = answer_text.find("</think>")
+                            if first_match != -1:
+                                modified_text = answer_text[:first_match] + answer_text[first_match + len("</think>"):]
+                                second_match = modified_text.find("</think>")
+                                
+                                if second_match == -1:
+                                    single_final_answer_count += 1
+                                else:
+                                    multiple_final_answer_count += 1
+                        
+                        avg_token_length = total_tokens / answer_count if answer_count > 0 else 0
+                        token_length_data['avg_token_length'] = avg_token_length
+                        token_length_data['total_tokens'] = total_tokens
+                        
+                        # 新增：计算平均delta_length
+                        avg_delta_length = total_delta_length / valid_delta_count if valid_delta_count > 0 else 0
+                        token_length_data['avg_delta_length'] = avg_delta_length
+                        token_length_data['avg_delta_length/BUDGET'] = avg_delta_length / token_length_data['budget_length']
+                        token_length_data['valid_delta_count'] = valid_delta_count
+                        
+                        token_length_metrics.append(token_length_data)
+                        
+                        final_answer_data['single_final_answer_count'] = single_final_answer_count
+                        final_answer_data['multiple_final_answer_count'] = multiple_final_answer_count
+                        final_answer_data['total_answer_count'] = answer_count
+                        final_answer_data['multiple_final_answer_ratio'] = multiple_final_answer_count / answer_count if answer_count > 0 else 0
+                        final_answer_metrics.append(final_answer_data)
+        
+        # 按budget_length排序
+        token_length_metrics.sort(key=lambda x: x['budget_length'])
+        final_answer_metrics.sort(key=lambda x: x['budget_length'])
+        
+        # 绘制图表 - 平均token长度
+        fig, ax = plt.subplots(figsize=(10, 6))
+        budget_lengths = [data['budget_length'] for data in token_length_metrics]
+        avg_lengths = [data['avg_token_length'] for data in token_length_metrics]
+        
+        length_csv = os.path.join(entry, "token_length_metrics.csv")
+        with open(length_csv, "w") as f:
+            f.write("budget_length,avg_token_length,total_tokens,avg_delta_length,valid_delta_count, avg_delta_length/BUDGET]\n")
+            for data in token_length_metrics:
+                f.write(f"{data['budget_length']},{data['avg_token_length']},{data['total_tokens']},{data['avg_delta_length']},{data['valid_delta_count']}, {data['avg_delta_length/BUDGET']}\n")
+        
+        ax.plot(budget_lengths, avg_lengths, marker='o', color='blue', linewidth=2)
+        ax.set_title(f"Average Token Length by Budget Length - {setting_name}")
+        ax.set_xlabel('Budget Length')
+        ax.set_ylabel('Average Token Length')
+        ax.grid(True)
+        
+        plt.tight_layout()
+        pic_name = os.path.join(entry, "token_length_metrics.png")
+        plt.savefig(pic_name, dpi=300)
+        print(f"Saved figure as {pic_name}")
+        plt.close()
+        
+        # 新增：绘制delta_length图表
+        fig, ax = plt.subplots(figsize=(10, 6))
+        avg_deltas = [data['avg_delta_length'] for data in token_length_metrics]
+        
+        ax.plot(budget_lengths, avg_deltas, marker='o', color='green', linewidth=2)
+        ax.set_title(f"Average Delta Length by Budget Length - {setting_name}")
+        ax.set_xlabel('Budget Length')
+        ax.set_ylabel('Average Delta Length (budget - actual)')
+        ax.grid(True)
+        
+        plt.tight_layout()
+        delta_pic_name = os.path.join(entry, "delta_length_metrics.png")
+        plt.savefig(delta_pic_name, dpi=300)
+        print(f"Saved delta figure as {delta_pic_name}")
+        plt.close()
+        
+        # 保存 **Final Answer** 的统计结果
+        final_answer_csv = os.path.join(entry, "final_answer_metrics.csv")
+        with open(final_answer_csv, "w") as f:
+            f.write("budget_length,single_final_answer_count,multiple_final_answer_count,total_answer_count,multiple_final_answer_ratio\n")
+            for data in final_answer_metrics:
+                f.write(f"{data['budget_length']},{data['single_final_answer_count']},{data['multiple_final_answer_count']},{data['total_answer_count']},{data['multiple_final_answer_ratio']}\n")

Chain_Of_Thought_Metric/metric.py

@@ -0,0 +1,172 @@
+import os
+import re
+from transformers import AutoTokenizer
+import json
+import matplotlib.pyplot as plt
+# from .Chain_Of_Thought_Metric.tools import *
+
+# 父文件夹路径
+parent_folder = "/mnt/lyc/wuxinrui/Qwen2.5-Math/evaluation"
+
+# pattern = re.compile(r"MODEL-.*-TIP-.*-STAGE-\d+")
+pattern = re.compile(r"MODEL-.*-TIP-.*-STAGE-add-DATA-.*")
+
+entry_list = []
+setting_names = []
+# tokenizer = AutoTokenizer.from_pretrained("/data05/wuxinrui/LLaMA-Factory/DS-distill-QWen-1_5B_TCM/models", trust_remote_code=True)
+
+for folder in os.listdir(parent_folder):
+    # if pattern.match(folder):
+    if folder == "MODEL-TCMv4_ablation_v1_step_77_reward_0.824-TIP-withoutremaining-STAGE-2-DATA-math500":
+        entry_list.append(os.path.join(parent_folder, folder))
+        setting_names.append(folder)
+
+def is_balanced(s: str) -> bool:
+    """验证大括号是否成对且正确嵌套"""
+    stack = 0
+    for char in s:
+        if char == "{":
+            stack += 1
+        elif char == "}":
+            stack -= 1
+            if stack < 0:
+                return False
+    return stack == 0
+
+        
+def find_sequence(array, sequence):
+    sequence_length = len(sequence)
+    array_length = len(array)
+    start_positions = []
+
+    for i in range(array_length - sequence_length + 1):
+        if array[i:i+sequence_length] == sequence:
+            start_positions.append(i)
+
+    return start_positions
+
+
+def get_final_answer_status(anwser):
+    find_string = "**Final Answer**\\boxed"
+    # find_string = "**Final Answer**"
+    sequence = [334, 19357, 21806, 334, 59, 79075]
+
+    Thought_END = 0
+    START = 0
+    END = 0
+    if not find_string in anwser:
+        return Thought_END, START, END
+    
+    else:
+        Thought_END = 1
+        
+        # #G ---------------- 匹配正反大括号
+        # start_idx = anwser.find('**Final Answer**\\boxed{')
+        # stack = 1
+        # end_idx = start_idx + len('**Final Answer**\\boxed{')
+        # while end_idx < len(anwser) and stack > 0:
+        #     if anwser[end_idx] == "{":
+        #         stack += 1
+        #     elif anwser[end_idx] == "}":
+        #         stack -= 1
+        #     end_idx += 1
+        # if stack == 0 and is_balanced(anwser[start_idx:end_idx]):
+        #     Thought_END = 1
+        #     # tokenized_answer = tokenizer(anwser)['input_ids']
+        #     # #G 找出结束时的token位置
+        #     # start_positions = find_sequence(tokenized_answer, sequence)
+        # else:
+        #     Thought_END = 0
+        #G -----------------
+            
+        return Thought_END, START, END
+           
+def calculate_ratios(thinking_ended, answer_correct):
+    # 初始化计数器
+    ET_count = 0
+    total_count = len(thinking_ended)
+    EF_count = 0
+    OT_count = 0
+
+    # 遍历列表
+    for i in range(total_count):
+        if thinking_ended[i] == 1 and answer_correct[i] == 1:
+            ET_count += 1
+        if thinking_ended[i] == 1 and answer_correct[i] == 0:
+            EF_count += 1
+        if thinking_ended[i] == 0 and answer_correct[i] == 1:
+            OT_count += 1
+
+    # 计算比值
+    ET_ratio = ET_count / total_count if total_count > 0 else 0
+    EF_ratio = EF_count / total_count if total_count > 0 else 0
+    OT_ratio = OT_count / total_count if total_count > 0 else 0
+
+    acc = sum(thinking_ended) / total_count if total_count > 0 else 0
+    
+    return ET_ratio, EF_ratio, OT_ratio, acc
+
+if __name__ == "__main__":
+
+    for entry, setting_name in zip(entry_list, setting_names):
+        CoT_metric_one_setting = []
+        for sub_entry in os.listdir(entry):
+            if not os.path.isdir(os.path.join(entry, sub_entry)):
+                continue
+        #G 对于每一个测试配置对应文件夹
+            for root, dirs, files in os.walk(os.path.join(entry, sub_entry)):
+            #g 遍历不同长度结果
+                for file in files:
+                    if "metrics" not in file:
+                        cot_answer_path = file
+                        cot_answer_path = os.path.join(root, cot_answer_path)
+                        #G 找到所有存储回答的jsonl文件
+            with open(cot_answer_path, "r") as f:
+                CoT_metric_single_budget = {}
+                budget_length = int(sub_entry)
+                CoT_metric_single_budget['budget_length'] = budget_length
+                True_list = []
+                End_list = []
+                for line in f:
+                    data = json.loads(line)
+                    if data['score'][0] == False:
+                        True_list.append(0)
+                    else:
+                        True_list.append(1)
+                    
+                    Thought_END, START, END = get_final_answer_status(data['code'][0])
+                    End_list.append(Thought_END)
+                    #G 获取每个回答的最终状态
+                    
+                ET_ratio, EF_ratio, OT_ratio, acc = calculate_ratios(End_list, True_list)
+                
+                CoT_metric_single_budget['ET_ratio'] = ET_ratio
+                CoT_metric_single_budget['EF_ratio'] = EF_ratio
+                CoT_metric_single_budget['OT_ratio'] = OT_ratio
+                CoT_metric_single_budget['acc'] = acc
+                
+                CoT_metric_one_setting.append(CoT_metric_single_budget)
+        CoT_metric_one_setting.sort(key=lambda x: x['budget_length'])
+        fig, axs = plt.subplots(2, 2, figsize=(15, 10))
+
+        # 定义指标名称和对应的索引
+        metrics = ['ET_ratio', 'EF_ratio', 'OT_ratio', 'acc']
+        titles = ['ET Ratio', 'EF Ratio', 'OT Ratio', 'Accuracy']
+        colors = ['blue', 'green', 'red', 'purple']
+        main_title = setting_name
+        for i, metric in enumerate(metrics):
+            ax = axs[i // 2, i % 2]
+            budget_lengths = [data['budget_length'] for data in CoT_metric_one_setting]
+            metric_values = [data[metric] for data in CoT_metric_one_setting]
+            ax.plot(budget_lengths, metric_values, marker='o', color=colors[i], linewidth=2)
+            ax.set_title(titles[i])
+            ax.set_xlabel('Budget Length')
+            ax.set_ylabel(metric)
+            ax.grid(True)
+        fig.suptitle(main_title, fontsize=16, y=1)
+
+        plt.tight_layout()
+        pic_name = os.path.join(entry, "metric.png")
+        plt.savefig(os.path.join(entry, pic_name), dpi=300)
+        print(f"Saved figure as {pic_name}")
+        plt.close()

Chain_Of_Thought_Metric/tools.py

@@ -0,0 +1,80 @@
+def is_balanced(s: str) -> bool:
+    """验证大括号是否成对且正确嵌套"""
+    stack = 0
+    for char in s:
+        if char == "{":
+            stack += 1
+        elif char == "}":
+            stack -= 1
+            if stack < 0:
+                return False
+    return stack == 0
+
+        
+def find_sequence(array, sequence):
+    sequence_length = len(sequence)
+    array_length = len(array)
+    start_positions = []
+
+    for i in range(array_length - sequence_length + 1):
+        if array[i:i+sequence_length] == sequence:
+            start_positions.append(i)
+
+    return start_positions
+
+
+def get_final_answer_status(anwser):
+    find_string = "**Final Answer**\\boxed"
+    sequence = [334, 19357, 21806, 334, 59, 79075]
+
+    Thought_END = 0
+    START = 0
+    END = 0
+    if not find_string in anwser:
+        return Thought_END, START, END
+    
+    else:
+        start_idx = anwser.find('**Final Answer**\\boxed{')
+        stack = 1
+        end_idx = start_idx + len('**Final Answer**\\boxed{')
+        while end_idx < len(anwser) and stack > 0:
+            if anwser[end_idx] == "{":
+                stack += 1
+            elif anwser[end_idx] == "}":
+                stack -= 1
+            end_idx += 1
+        if stack == 0 and is_balanced(anwser[start_idx:end_idx]):
+            Thought_END = 1
+            # tokenized_answer = tokenizer(anwser)['input_ids']
+            # #G 找出结束时的token位置
+            # start_positions = find_sequence(tokenized_answer, sequence)
+
+        else:
+            Thought_END = 0
+            
+        return Thought_END, START, END
+           
+def calculate_ratios(thinking_ended, answer_correct):
+    # 初始化计数器
+    TP_count = 0
+    total_count = len(thinking_ended)
+    thinking_ended_count = 0
+    answer_correct_count = 0
+
+    # 遍历列表
+    for i in range(total_count):
+        if thinking_ended[i] == 1 and answer_correct[i] == 1:
+            ET_count += 1
+        if thinking_ended[i] == 1 and answer_correct[i] == 0:
+            EF_count += 1
+        if answer_correct[i] == 0 and answer_correct[i] == 1:
+            OT_count += 1
+
+    # 计算比值
+    ET_ratio = ET_count / total_count if total_count > 0 else 0
+    EF_ratio = TP_count / total_count if total_count > 0 else 0
+    OT_ratio = OT_count / total_count if total_count > 0 else 0
+
+    acc = sum(answer_correct) / total_count if total_count > 0 else 0
+    
+    return ET_ratio, EF_ratio, OT_ratio, acc

GPU_hunter.py

@@ -0,0 +1,57 @@
+import subprocess
+import time
+import logging 
+
+
+logger = logging.getLogger()
+log_file_path = "gpu_hunter.log"
+logger.addHandler(logging.FileHandler(log_file_path))
+logging.basicConfig(filename=log_file_path, level=logging.DEBUG, format='%(asctime)s - %(message)s')
+print("start hunting")
+def get_gpu_memory_usage():
+    try:
+        output = subprocess.check_output(
+            ["nvidia-smi", "--query-gpu=memory.used,memory.total",
+             "--format=csv,noheader,nounits", "-i", "0,1,2,3"],
+            universal_newlines=True
+        )
+        return output.strip().split('\n')
+    except Exception as e:
+        print(f"Error getting GPU info: {e}")
+        return None
+
+def check_low_usage(threshold=10):
+    gpu_data = get_gpu_memory_usage()
+    if not gpu_data:
+        return False
+
+    for gpu in gpu_data:
+        used, total = map(int, gpu.split(', '))
+        usage_percent = (used / total) * 100
+        if usage_percent >= threshold:
+            return False
+    return True
+
+def main():
+    check_interval = 60*10  # 检查间隔（秒）
+    command_to_run = "bash /mnt/lyc/wuxinrui/Qwen2.5-Math/evaluation/remaining_eval/TCMv4_Nratio_copy.sh"  # 替换为需要执行的命令
+
+    while True:
+        if check_low_usage(threshold=10):
+            time.sleep(check_interval)
+            if check_low_usage(threshold=10):
+                print("All GPUs have memory usage below 10%. Executing command...")
+                
+                subprocess.run('conda deactivate', shell=True)
+                subprocess.run('conda activate QMath-wxr', shell=True)
+                subprocess.run(command_to_run, shell=True)
+
+                print("Command executed. Exiting GPU monitoring.")
+                break  # 退出循环，停止监听
+        else:
+            print("GPUs are in use. Waiting...")
+        
+        time.sleep(check_interval)
+
+if __name__ == "__main__":
+    main()

LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2024 Zhibin Gou
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

README.md

@@ -0,0 +1,52 @@
+### Requirements
+You can install the required packages with the following command:
+```bash
+cd latex2sympy
+pip install -e .
+cd ..
+pip install -r requirements.txt 
+pip install vllm==0.5.1 --no-build-isolation
+pip install transformers==4.42.3
+```
+
+### Evaluation
+You can evaluate Qwen2.5/Qwen2-Math-Instruct series model with the following command:
+```bash
+# Qwen2.5-Math-Instruct Series
+PROMPT_TYPE="qwen25-math-cot"
+# Qwen2.5-Math-1.5B-Instruct
+export CUDA_VISIBLE_DEVICES="0"
+MODEL_NAME_OR_PATH="Qwen/Qwen2.5-Math-1.5B-Instruct"
+bash sh/eval.sh $PROMPT_TYPE $MODEL_NAME_OR_PATH
+
+# Qwen2.5-Math-7B-Instruct
+export CUDA_VISIBLE_DEVICES="0"
+MODEL_NAME_OR_PATH="Qwen/Qwen2.5-Math-7B-Instruct"
+bash sh/eval.sh $PROMPT_TYPE $MODEL_NAME_OR_PATH
+
+# Qwen2.5-Math-72B-Instruct
+export CUDA_VISIBLE_DEVICES="0,1,2,3"
+MODEL_NAME_OR_PATH="Qwen/Qwen2.5-Math-72B-Instruct"
+bash sh/eval.sh $PROMPT_TYPE $MODEL_NAME_OR_PATH
+
+
+# Qwen2-Math-Instruct Series
+PROMPT_TYPE="qwen-boxed"
+# Qwen2-Math-1.5B-Instruct
+export CUDA_VISIBLE_DEVICES="0"
+MODEL_NAME_OR_PATH="Qwen/Qwen2-Math-1.5B-Instruct"
+bash sh/eval.sh $PROMPT_TYPE $MODEL_NAME_OR_PATH
+
+# Qwen2-Math-7B-Instruct
+export CUDA_VISIBLE_DEVICES="0"
+MODEL_NAME_OR_PATH="Qwen/Qwen2-Math-7B-Instruct"
+bash sh/eval.sh $PROMPT_TYPE $MODEL_NAME_OR_PATH
+
+# Qwen2-Math-72B-Instruct
+export CUDA_VISIBLE_DEVICES="0,1,2,3"
+MODEL_NAME_OR_PATH="Qwen/Qwen2-Math-72B-Instruct"
+bash sh/eval.sh $PROMPT_TYPE $MODEL_NAME_OR_PATH
+```
+
+## Acknowledgement
+The codebase is adapted from [math-evaluation-harness](https://github.com/ZubinGou/math-evaluation-harness).

api_test.py

@@ -0,0 +1,448 @@
+import random
+import os
+import argparse
+import time
+from datetime import datetime
+from tqdm import tqdm
+from transformers import AutoTokenizer
+import logging
+import json
+from openai import OpenAI
+
+from eval_tools import apply_RL_prompt, solve_final_answer
+from evaluate import evaluate
+from utils import set_seed, load_jsonl, save_jsonl, construct_prompt
+from parser import *
+from trajectory import *
+from data_loader import load_data
+from python_executor import PythonExecutor
+
+# Initialize OpenAI client
+client = OpenAI(
+    base_url='https://api.apikey.vip/v1',
+    api_key='sk-SZvcdq0lrEx3uqgYEs2QuxJ5Eft7ANYK5JPEjHSVAOJHGEzV'
+)
+
+## Setup logging
+if not os.path.exists(f'{os.environ["modelname"]}'):
+    os.mkdir(f'{os.environ["modelname"]}')
+if not os.path.exists(f'{os.environ["model"]}'):
+    os.mkdir(f'{os.environ["model"]}')
+
+DATA_NAME = os.environ["DATA_NAME"]
+logging.basicConfig(level=logging.INFO, format='%(asctime)s - %(name)s - %(levelname)s - %(message)s',
+                    datefmt='%Y-%m-%d %H:%M:%S', filename=f'{os.environ["model"]}/{os.environ["mode"]}-{DATA_NAME}.log', filemode='a')
+print(f"logging in {os.environ['model']}/{os.environ['mode']}-{DATA_NAME}.log")
+
+logging.info(f"modelname's infor:  {os.environ['modelname']}")
+logging.info(f"mode's infor:  {os.environ['mode']}")
+logging.info(f"model's infor:  {os.environ['model']}")
+
+with open('./special_tokens.json') as f:
+    special_tokens = json.load(f)
+
+bins_tokens = [
+    special_tokens[f"{i}"] for i in range(400)
+]
+
+def clean_code(code):
+    for bin_token in bins_tokens:
+        if bin_token in code:
+            code = code.replace(bin_token, "")
+    return code
+
+def parse_args():
+    parser = argparse.ArgumentParser()
+    parser.add_argument("--ratio", type=float, default=-1, help="ratio of cot to use for generation")
+    parser.add_argument("--data_names", default="math", type=str)
+    parser.add_argument("--data_dir", default="./data", type=str)
+    parser.add_argument("--model_name_or_path", default="Qwen/QwQ-32B-Preview", type=str)
+    parser.add_argument("--output_dir", default="Qwen/QwQ-32B-Preview/math_eval", type=str)
+    parser.add_argument("--prompt_type", default="qwen25-math-cot", type=str)
+    parser.add_argument("--split", default="test", type=str)
+    parser.add_argument("--num_test_sample", default=-1, type=int)  # -1 for full data
+    parser.add_argument("--seed", default=0, type=int)
+    parser.add_argument("--start", default=0, type=int)
+    parser.add_argument("--end", default=-1, type=int)
+    parser.add_argument("--temperature", default=0, type=float)
+    parser.add_argument("--n_sampling", default=1, type=int)
+    parser.add_argument("--top_p", default=1, type=float)
+    parser.add_argument("--max_tokens_per_call", default=4096, type=int)
+    parser.add_argument("--shuffle", action="store_true")
+    parser.add_argument("--use_vllm", action="store_true")
+    parser.add_argument("--save_outputs", action="store_true")
+    parser.add_argument("--overwrite", action="store_true")
+    parser.add_argument("--use_safetensors", action="store_true")
+    parser.add_argument("--num_shots", type=int, default=0)
+    parser.add_argument("--apply_chat_template", action="store_true", help="Apply chat template to prompt.",)
+    args = parser.parse_args()
+    args.top_p = (1 if args.temperature == 0 else args.top_p)
+    return args
+
+def set_output_path(args, data_name):
+    model_name_list = args.model_name_or_path.split('/')[-1]
+    model_name = model_name_list
+    for part in model_name_list:
+        if 'models' in part:
+            model_name = part
+    
+    output_dir = os.path.join(args.output_dir, model_name, args.prompt_type)
+    out_file_prefix = f"{args.split}_{args.prompt_type}_{args.num_test_sample}_seed{args.seed}_t{args.temperature}"
+    out_file = f"{output_dir}/{data_name}/{out_file_prefix}_s{args.start}_e{args.end}_b{int(args.max_tokens_per_call)}_original.jsonl"
+    print(out_file)
+    os.makedirs(f"{output_dir}/{data_name}", exist_ok=True)
+    return out_file_prefix, output_dir, out_file
+
+def prepare_data(data_name, args):
+    examples = load_data(data_name, args.split, args.data_dir)
+
+    if args.num_test_sample > 0:
+        examples = examples[: args.num_test_sample]
+
+    if args.shuffle:
+        random.seed(datetime.now().timestamp())
+        random.shuffle(examples)
+
+    examples = examples[args.start : len(examples) if args.end == -1 else args.end]
+
+    dt_string = datetime.now().strftime("%m-%d_%H-%M")
+    model_name = "/".join(args.model_name_or_path.split("/")[-2:])
+    
+    out_file_prefix, output_dir, out_file = set_output_path(args, data_name)
+
+    processed_samples = []
+    if not args.overwrite:
+        processed_files = [
+            f
+            for f in os.listdir(f"{output_dir}/{data_name}/")
+            if f.endswith(".jsonl") and f.startswith(out_file_prefix)
+        ]
+        for f in processed_files:
+            processed_samples.extend(
+                list(load_jsonl(f"{output_dir}/{data_name}/{f}"))
+    )
+
+    processed_samples = {sample["idx"]: sample for sample in processed_samples}
+    processed_idxs = list(processed_samples.keys())
+    processed_samples = list(processed_samples.values())
+    examples = [example for example in examples if example["idx"] not in processed_idxs]
+    return examples, processed_samples, out_file
+
+def is_multi_choice(answer):
+    for c in answer:
+        if c not in ["A", "B", "C", "D", "E"]:
+            return False
+    return True
+
+def get_api_response(prompt, max_tokens=4096, temperature=0.5):
+    try:
+        completion = client.chat.completions.create(
+            messages=[
+                {
+                    "role": "user",
+                    "content": prompt,
+                }
+            ],
+            model="o1-mini",
+            timeout=200,
+            temperature=temperature,
+            max_tokens=max_tokens,
+        )
+        return completion.choices[0].message.content
+    except Exception as e:
+        print(f"Error in API call: {e}")
+        return ""
+
+def main(llm, tokenizer, data_name, args):
+    examples, processed_samples, out_file = prepare_data(data_name, args)
+    print(examples[0])
+    print("\n" + "-" * 50)
+    print("data:", data_name, ", remain samples:", len(examples))
+    if len(examples) > 0:
+        print(examples[0])
+
+    # init python executor
+    if "pal" in args.prompt_type:
+        executor = PythonExecutor(get_answer_expr="solution()")
+    else:
+        executor = PythonExecutor(get_answer_from_stdout=True)
+
+    # load done samples
+    if args.ratio > 0:
+        done_samples_path = out_file.replace("_r" + str(args.ratio), "")
+        done_samples = list(load_jsonl(done_samples_path))
+    else:
+        done_samples = []
+    done_samples = {sample["idx"]: sample for sample in done_samples}
+    
+    samples = []
+    print("\nProcessing", len(examples), "examples", "=" * 50)
+    for example in tqdm(examples, total=len(examples)):
+        idx = example["idx"]
+
+        # parse question and answer
+        example["question"] = parse_question(example, data_name)
+        if example["question"] == "":
+            continue
+        gt_cot, gt_ans = parse_ground_truth(example, data_name)
+        example["gt_ans"] = gt_ans
+        full_prompt = construct_prompt(example, data_name, args)
+        
+        if args.ratio > 0:
+            done_cot = done_samples[idx]["code"][0]
+            cut_cot = done_cot[:int(len(done_cot)*args.ratio)]
+            full_prompt = full_prompt + cut_cot + "\n\nFinal answer within \\boxed{{}}:\n"
+
+        if idx == args.start:
+            print(full_prompt)
+
+        sample = {
+            "idx": idx,
+            "question": example["question"],
+            "gt_cot": gt_cot,
+            "gt": gt_ans,
+            "prompt": full_prompt,
+        }
+
+        # add remain fields
+        for key in [
+            "level",
+            "type",
+            "unit",
+            "solution_type",
+            "choices",
+            "solution",
+            "ques_type",
+            "ans_type",
+            "answer_type",
+            "dataset",
+            "subfield",
+            "filed",
+            "theorem",
+            "answer",
+        ]:
+            if key in example:
+                sample[key] = example[key]
+        samples.append(sample)
+
+    # repeat n times
+    input_prompts = [sample["prompt"] for sample in samples for _ in range(args.n_sampling)]
+    input_prompts = apply_RL_prompt(input_prompts, args, budget=args.max_tokens_per_call)
+    
+    if args.apply_chat_template:
+        tokenizer = AutoTokenizer.from_pretrained(
+            args.model_name_or_path, trust_remote_code=True, max_length=16000,
+        )
+        input_prompts = [
+            tokenizer.apply_chat_template(
+                [{"role": "user", "content": prompt.strip()}],
+                tokenize=False,
+                add_generation_prompt=True,
+            )
+            for prompt in input_prompts
+        ]
+    
+    remain_prompts = input_prompts
+    remain_prompts = [(i, prompt) for i, prompt in enumerate(remain_prompts)]
+    end_prompts = []
+
+    max_func_call = 1 if args.prompt_type in ["cot", "pal", "qwen25-math-cot"] else 4
+
+    stop_words = ["</s>", "<|im_end|>", "<|endoftext|>"]
+
+    if args.prompt_type in ["cot"]:
+        stop_words.append("\n\nQuestion:")
+    if args.prompt_type in ["pal", "tool-integrated", "jiuzhang_tora"]:
+        stop_words.extend(["\n\n---", "```output"])
+    elif args.prompt_type in ["wizard_zs", "platypus_fs"]:
+        stop_words.extend(["Instruction", "Response"])
+    elif "jiuzhang" in args.prompt_type:
+        stop_words.append("\n\n## Question")
+    elif "numina" in args.prompt_type:
+        stop_words.append("\n### Problem")
+    elif "pure" in args.prompt_type:
+        stop_words.append("\n\n\n")
+
+    # start inference
+    start_time = time.time()
+    print(f"start_time: {start_time}")
+    for epoch in range(max_func_call):
+        print("-" * 20, "Epoch", epoch)
+        current_prompts = remain_prompts
+        if len(current_prompts) == 0:
+            break
+
+        prompts = [item[1] for item in current_prompts]
+        
+        # Call API for each prompt
+        outputs = []
+        for prompt in tqdm(prompts, desc="Calling API"):
+            response = get_api_response(prompt, max_tokens=args.max_tokens_per_call, temperature=args.temperature)
+            outputs.append(response)
+        
+        print('stage one finished!!!\n' * 20)
+        print(outputs[:3])
+        
+        if os.environ['stage'] == "2":
+            print("stage 2")
+            modified_outputs = []
+            for output in outputs:
+                if "" in output:
+                    start_index = output.index("")
+                    output = output[:start_index]
+                modified_output = output + "\n</think>\n\n**Final Answer**\\boxed"
+                modified_outputs.append(modified_output)
+            
+            # Call API again for stage 2
+            stage2_outputs = []
+            for prompt in tqdm(modified_outputs, desc="Stage 2 API calls"):
+                response = get_api_response(prompt, max_tokens=20, temperature=args.temperature)
+                stage2_outputs.append(response)
+            
+            outputs = stage2_outputs
+
+        assert len(outputs) == len(current_prompts)
+        
+        # process all outputs
+        remain_prompts = []
+        remain_codes = []
+        for (i, query), output in zip(current_prompts, outputs):
+            output = output.rstrip()
+            query += output
+            if args.prompt_type == "pal":
+                remain_prompts.append((i, query))
+                if "```python" in output:
+                    output = extract_program(query)
+                remain_codes.append(output)
+            elif args.prompt_type == "cot":
+                end_prompts.append((i, query))
+            elif "boxed" not in output and output.endswith("```"):
+                program = extract_program(query)
+                remain_prompts.append((i, query))
+                remain_codes.append(program)
+            else:
+                end_prompts.append((i, query))
+
+        # execute the remain prompts
+        remain_results = executor.batch_apply(remain_codes)
+        for k in range(len(remain_prompts)):
+            i, query = remain_prompts[k]
+            res, report = remain_results[k]
+            exec_result = res if res else report
+            if "pal" in args.prompt_type:
+                exec_result = "\\boxed{" + exec_result + "}"
+            exec_result = f"\n```output\n{exec_result}\n```\n"
+            query += exec_result
+            if epoch == max_func_call - 1:
+                query += "\nReach max function call limit."
+            remain_prompts[k] = (i, query)
+
+    # unsolved samples
+    print("Unsolved samples:", len(remain_prompts))
+    end_prompts.extend(remain_prompts)
+    end_prompts = sorted(end_prompts, key=lambda x: x[0])
+
+    # remove input_prompt from end_prompt
+    codes = []
+    assert len(input_prompts) == len(end_prompts)
+    for i in range(len(input_prompts)):
+        _, end_prompt = end_prompts[i]
+        code = end_prompt.split(input_prompts[i])[-1].strip()
+        for stop_word in stop_words:
+            if stop_word in code:
+                code = code.split(stop_word)[0].strip()
+        if args.prompt_type == "deepseek3":
+            if '```' in code:
+                code = code.split("```")[1]
+        codes.append(code)
+        
+    results = [
+        run_execute(executor, clean_code(code), args.prompt_type, data_name) for code in codes
+    ]
+    time_use = time.time() - start_time
+
+    # put results back to examples
+    all_samples = []
+    for i, sample in enumerate(samples):
+        code = codes[i * args.n_sampling : (i + 1) * args.n_sampling]
+        result = results[i * args.n_sampling : (i + 1) * args.n_sampling]
+        preds = [item[0] for item in result]
+        reports = [item[1] for item in result]
+        for j in range(len(preds)):
+            if sample["gt"] in ["A", "B", "C", "D", "E"] and preds[j] not in [
+                "A",
+                "B",
+                "C",
+                "D",
+                "E",
+            ]:
+                preds[j] = choice_answer_clean(code[j])
+            elif is_multi_choice(sample["gt"]) and not is_multi_choice(preds[j]):
+                preds[j] = "".join(
+                    [c for c in preds[j] if c in ["A", "B", "C", "D", "E"]]
+                )
+
+        sample.update({"code": code, "pred": preds, "report": reports})
+        all_samples.append(sample)
+
+    # add processed samples
+    all_samples.extend(processed_samples)
+    all_samples, result_json = evaluate(
+        samples=all_samples,
+        data_name=data_name,
+        prompt_type=args.prompt_type,
+        execute=True,
+    )
+
+    # save outputs
+    if len(processed_samples) < len(all_samples) and args.save_outputs:
+        save_jsonl(all_samples, out_file)
+
+    result_json["time_use_in_second"] = time_use
+    result_json["time_use_in_minite"] = (
+        f"{int(time_use // 60)}:{int(time_use % 60):02d}"
+    )
+
+    with open(
+        out_file.replace(".jsonl", "_metrics.json"), "w"
+    ) as f:
+        json.dump(result_json, f, indent=4)
+    return result_json
+
+def setup(args):
+    tokenizer = None
+    if args.apply_chat_template:
+        tokenizer = AutoTokenizer.from_pretrained(
+            args.model_name_or_path, trust_remote_code=True, max_length=16000,
+        )
+
+    # infer & eval
+    data_list = args.data_names.split(",")
+    results = []
+    for data_name in data_list:
+        results.append(main(None, tokenizer, data_name, args))
+
+    # add "avg" result
+    data_list.append("avg")
+    results.append(
+        {
+            "acc": sum([result["acc"] for result in results]) / len(results),
+        }
+    )
+
+    # print all results
+    pad = max([len(data_name) for data_name in data_list])
+    print("\t".join(data_name.ljust(pad, " ") for data_name in data_list))
+    print("\t".join([f"{result['acc']:.1f}".ljust(pad, " ") for result in results]))
+ 
+    logging.info("\t".join(data_name.ljust(pad, " ") for data_name in data_list))
+    logging.info(f"os.environ['PE_MODE'] = {os.environ['PE_MODE']}")
+    logging.info(f"path = {args.model_name_or_path}")
+    logging.info(f"tip = {os.environ['tip']}")
+    logging.info(f"BUDGET = {os.environ['BUDGET']}")
+    logging.info("\t".join([f"{result['acc']:.1f}".ljust(pad, " ") for result in results]))
+
+if __name__ == "__main__":
+    args = parse_args()
+    set_seed(args.seed)
+    setup(args)

copy_backup.py

@@ -0,0 +1,36 @@
+import os
+import shutil
+
+def copy_folder(src, dst):
+    """
+    复制文件夹，忽略以字母t开头的子文件夹
+    :param src: 源文件夹路径
+    :param dst: 目标文件夹路径
+    """
+    # 确保目标文件夹存在
+    if not os.path.exists(dst):
+        os.makedirs(dst)
+
+    # 遍历源文件夹
+    for item in os.listdir(src):
+        src_item = os.path.join(src, item)
+        dst_item = os.path.join(dst, item)
+
+        # 如果是文件，直接复制
+        if os.path.isfile(src_item):
+            shutil.copy2(src_item, dst_item)
+        # 如果是文件夹
+        elif os.path.isdir(src_item):
+            # 如果文件夹名以t开头，跳过
+            if item.lower().startswith('model'):
+                print(f"Skipping folder: {item}")
+                continue
+            # 否则递归复制文件夹
+            copy_folder(src_item, dst_item)
+
+# 示例用法
+source_folder = "/mnt/lyc/wuxinrui/Qwen2.5-Math/evaluation"  # 源文件夹路径
+destination_folder = "/mnt/lyc/wuxinrui/BudgetThinker/evaluation"  # 目标文件夹路径
+
+copy_folder(source_folder, destination_folder)
+print("Folder copied successfully.")

data/aime24/aime24.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:233fada048d48294f7d7a78ecec38563eaea206ae9eb92c35684c7aac469bb47
+size 10230

data/amc23/amc23.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:cb2c49887d2a73ffb5b8e37f5352a8deca779f5a2308bba089a317338fd10545
+size 9919

data/carp_en/demo.json

@@ -0,0 +1,8 @@
+{"content": "If $3 a ^ { m + 2 } b$ and $\\frac { 1 } { 2 } ab ^ { n - 1 }$ are similar terms, then $m + n$ is equal to.", "answer": "1", "steps": "$3 a ^ { m + 2 } b$ and $\\frac { 1 } { 2 } ab ^ { n - 1 }$ are like terms. We can obtain $m + 2 = 1$ and $n - 1 = 1$. Solving for $m$ and $n$, we get $m = - 1$ and $n = 2$. Therefore, $m + n = - 1 + 2 = 1$.", "expr_cands": ["3 a ^ { m + 2 } b", "a", "m", "b", "\\frac { 1 } { 2 } ab ^ { n - 1 }", "n", "m + n", "m + 2 = 1", "m = - 1", "n - 1 = 1", "n = 2", "1"], "exprs": ["m + 2 = 1", "n - 1 = 1", "m = - 1", "n = 2", "1"], "edges": {"directed": true, "multigraph": false, "graph": {}, "nodes": [{"id": "3 a ^ { m + 2 } b"}, {"id": "m + 2 = 1"}, {"id": "\\frac { 1 } { 2 } ab ^ { n - 1 }"}, {"id": "$3 a ^ { m + 2 } b$ 与 $\\frac { 1 } { 2 } ab ^ { n - 1 }$ 是同类项"}, {"id": "n - 1 = 1"}, {"id": "m = - 1"}, {"id": "n = 2"}, {"id": "m + n"}, {"id": "1"}], "links": [{"rel": "被描述", "source": "3 a ^ { m + 2 } b", "target": "m + 2 = 1"}, {"rel": "被描述", "source": "3 a ^ { m + 2 } b", "target": "n - 1 = 1"}, {"rel": "等式方程求解", "source": "m + 2 = 1", "target": "m = - 1"}, {"rel": "被描述", "source": "\\frac { 1 } { 2 } ab ^ { n - 1 }", "target": "m + 2 = 1"}, {"rel": "被描述", "source": "\\frac { 1 } { 2 } ab ^ { n - 1 }", "target": "n - 1 = 1"}, {"rel": "限制性描述", "source": "$3 a ^ { m + 2 } b$ 与 $\\frac { 1 } { 2 } ab ^ { n - 1 }$ 是同类项", "target": "m + 2 = 1"}, {"rel": "限制性描述", "source": "$3 a ^ { m + 2 } b$ 与 $\\frac { 1 } { 2 } ab ^ { n - 1 }$ 是同类项", "target": "n - 1 = 1"}, {"rel": "等式方程求解", "source": "n - 1 = 1", "target": "n = 2"}, {"rel": "代入", "source": "m = - 1", "target": "1"}, {"rel": "代入", "source": "n = 2", "target": "1"}, {"rel": "被代入", "source": "m + n", "target": "1"}]}}
+{"content": "The solution to the equation $y - \\frac { y - 1 } { 2 } = - \\frac { y + 2 } { 5 }$ is ____ ?", "answer": "y = - \\frac { 9 } { 7 }", "steps": "To eliminate the denominator, we have $10 y - 5 ( y - 1 ) = - 2 ( y + 2 )$. Expanding the brackets gives $10 y - 5 y + 5 = - 2 y - 4$. Rearranging terms gives $10 y - 5 y + 2 y = - 4 - 5$, which simplifies to $7 y = - 9$. Dividing both sides by 7 gives $y = - \\frac { 9 } { 7 }$.", "expr_cands": ["y - \\frac { y - 1 } { 2 } = - \\frac { y + 2 } { 5 }", "y", "10 y - 5 ( y - 1 ) = - 2 ( y + 2 )", "y = - \\frac { 9 } { 7 }", "10 y - 5 y + 5 = - 2 y - 4", "10 y - 5 y + 2 y = - 4 - 5", "7 y = - 9", "1"], "exprs": ["y = - \\frac { 9 } { 7 }"], "edges": {"directed": true, "multigraph": false, "graph": {}, "nodes": [{"id": "y - \\frac { y - 1 } { 2 } = - \\frac { y + 2 } { 5 }"}, {"id": "y = - \\frac { 9 } { 7 }"}], "links": [{"rel": "等式方程求解", "source": "y - \\frac { y - 1 } { 2 } = - \\frac { y + 2 } { 5 }", "target": "y = - \\frac { 9 } { 7 }"}]}}
+{"content": "If $( m + 4 ) ^ 2 + | n - 3 | = 0$, then $\\frac { 1 } { 2 } m - n$ = ____?", "answer": "- 5", "steps": "$\\because ( m + 4 ) ^ 2 + | n - 3 | = 0$, $\\therefore m + 4 = 0$, $n - 3 = 0$, which means $m = - 4$, $n = 3$. Then the original expression equals $- 2 - 3 = - 5$.", "expr_cands": ["( m + 4 ) ^ { 2 } + | n - 3 | = 0", "m", "n", "\\frac { 1 } { 2 } m - n", "m + 4 = 0", "m = - 4", "n - 3 = 0", "n = 3", "- 2 - 3", "- 5"], "content_formula": [[["(", "m", "+", "4", ")", "^", "{", "2", "}", "+", "|", "n", "-", "3", "|", "=", "0"], ["\\frac", "{", "1", "}", "{", "2", "}", "m", "-", "n"]], [[1, 18], [20, 30]]], "steps_formula": [[["(", "m", "+", "4", ")", "^", "{", "2", "}", "+", "|", "n", "-", "3", "|", "=", "0"], ["m", "+", "4", "=", "0"], ["n", "-", "3", "=", "0"], ["m", "=", "-", "4"], ["n", "=", "3"], ["-", "2", "-", "3", "=", "-", "5"]], [[1, 18], [20, 25], [26, 31], [33, 37], [38, 41], [45, 52]]], "exprs": ["m + 4 = 0", "n - 3 = 0", "m = - 4", "n = 3", "- 5"], "edges": {"directed": true, "multigraph": false, "graph": {}, "nodes": [{"id": "( m + 4 ) ^ { 2 } + | n - 3 | = 0"}, {"id": "m + 4 = 0"}, {"id": "绝对值恒大于等于0"}, {"id": "n - 3 = 0"}, {"id": "多项式偶次方项恒大于等于0"}, {"id": "m = - 4"}, {"id": "n = 3"}, {"id": "\\frac { 1 } { 2 } m - n"}, {"id": "- 5"}], "links": [{"rel": "被描述", "source": "( m + 4 ) ^ { 2 } + | n - 3 | = 0", "target": "m + 4 = 0"}, {"rel": "被描述", "source": "( m + 4 ) ^ { 2 } + | n - 3 | = 0", "target": "n - 3 = 0"}, {"rel": "等式方程求解", "source": "m + 4 = 0", "target": "m = - 4"}, {"rel": "属性描述", "source": "绝对值恒大于等于0", "target": "m + 4 = 0"}, {"rel": "等式方程求解", "source": "n - 3 = 0", "target": "n = 3"}, {"rel": "属性描述", "source": "多项式偶次方项恒大于等于0", "target": "n - 3 = 0"}, {"rel": "代入", "source": "m = - 4", "target": "- 5"}, {"rel": "代入", "source": "n = 3", "target": "- 5"}, {"rel": "被代入", "source": "\\frac { 1 } { 2 } m - n", "target": "- 5"}]}}
+{"content": "Given a quadratic equation in one variable $x$, $x ^ 2 + x + m = 0$, with one root being $x = 1$, what is the other root of this equation?", "answer": "- 2", "steps": "Suppose the quadratic equation in one variable about $x$ is $x ^ 2 + x + m = 0$, and $\\alpha$ is another real root of the equation. Since one real root of the quadratic equation in one variable about $x$ is $1$, we have $\\alpha + 1 = - 1$. Therefore, $\\alpha = - 2$.", "expr_cands": ["x", "x ^ { 2 } + x + m = 0", "m", "x = 1", "1", "\\alpha + 1 = - 1", "alpha = - 2", "\\alpha", "\\alpha = - 2"], "exprs": ["\\alpha + 1 = - 1", "\\alpha = - 2"], "edges": {"directed": true, "multigraph": false, "graph": {}, "nodes": [{"id": "x ^ { 2 } + x + m = 0"}, {"id": "\\alpha + 1 = - 1"}, {"id": "x = 1"}, {"id": "关于 $x$ 的一元二次方程 $x ^ { 2 } + x + m = 0$ 的一个根是 $x = 1$"}, {"id": "设关于 $x$ 的一元二次方程 $x ^ { 2 } + x + m = 0$ 的另一个实数根是 \\alpha"}, {"id": "一元二次方程根与系数关系，两根之和"}, {"id": "\\alpha = - 2"}], "links": [{"rel": "被描述", "source": "x ^ { 2 } + x + m = 0", "target": "\\alpha + 1 = - 1"}, {"rel": "等式方程求解", "source": "\\alpha + 1 = - 1", "target": "\\alpha = - 2"}, {"rel": "被描述", "source": "x = 1", "target": "\\alpha + 1 = - 1"}, {"rel": "限制性描述", "source": "关于 $x$ 的一元二次方程 $x ^ { 2 } + x + m = 0$ 的一个根是 $x = 1$", "target": "\\alpha + 1 = - 1"}, {"rel": "假设描述", "source": "设关于 $x$ 的一元二次方程 $x ^ { 2 } + x + m = 0$ 的另一个实数根是 \\alpha", "target": "\\alpha + 1 = - 1"}, {"rel": "属性描述", "source": "一元二次方程根与系数关系，两根之和", "target": "\\alpha + 1 = - 1"}]}}
+{"content": "The parabola $y = - 5 { x } ^ 2 + 1$ is translated $2$ units upward and $1$ unit to the left, resulting in the parabola _____.", "answer": "y = - 5 ( x + 1 )  ^ { 2 } + 3", "steps": "The parabola $y = - 5 { x } ^ 2 + 1$ is first shifted upward by 2 units, resulting in $y = - 5 { x } ^ 2 + 3$. Then it is shifted left by 1 unit, resulting in $y = - 5 {( x + 1 )} ^ 2 + 3$.", "expr_cands": ["y = - 5 { x } ^ { 2 } + 1", "y", "x", "2", "1", "y = - 5 { x } ^ { 2 } + 3", "1 - 5 x ^ { 2 } = - 5 { x } ^ { 2 } + 3", "y = - 5 { ( x + 1 ) } ^ { 2 } + 3", "3 - 5 x ^ { 2 } = - 5 { ( x + 1 ) } ^ { 2 } + 3", "3 - 5 x ^ { 2 }", "y = - 5 ( x + 1 )  ^ { 2 } + 3"], "exprs": ["y = - 5 { ( x + 1 ) } ^ { 2 } + 3"], "edges": {"directed": true, "multigraph": false, "graph": {}, "nodes": [{"id": "2"}, {"id": "y = - 5 { ( x + 1 ) } ^ { 2 } + 3"}, {"id": "y = - 5 { x } ^ { 2 } + 1"}, {"id": "1"}, {"id": "将抛物线 $y = - 5 { x } ^ { 2 } + 1$ 向上平移 $2$ 个单位长度"}, {"id": "再向左平移 $1$ 个单位长度"}], "links": [{"rel": "被描述", "source": "2", "target": "y = - 5 { ( x + 1 ) } ^ { 2 } + 3"}, {"rel": "被描述", "source": "y = - 5 { x } ^ { 2 } + 1", "target": "y = - 5 { ( x + 1 ) } ^ { 2 } + 3"}, {"rel": "被描述", "source": "1", "target": "y = - 5 { ( x + 1 ) } ^ { 2 } + 3"}, {"rel": "限制性描述", "source": "将抛物线 $y = - 5 { x } ^ { 2 } + 1$ 向上平移 $2$ 个单位长度", "target": "y = - 5 { ( x + 1 ) } ^ { 2 } + 3"}, {"rel": "限制性描述", "source": "再向左平移 $1$ 个单位长度", "target": "y = - 5 { ( x + 1 ) } ^ { 2 } + 3"}]}}
+{"content": "If the radical $\\sqrt { x - 8 }$ is defined, then the range of real numbers for $x$ is ____ ?", "answer": "x \\ge 8", "steps": "Since the radical $\\sqrt { x - 8 }$ is defined, therefore $x - 8 \\ge 0$, which implies $x \\ge 8$.", "expr_cands": ["\\sqrt { x - 8 }", "x", "x - 8 \\ge 0", "8 \\le x", "x \\ge 8"], "exprs": ["x - 8 \\ge 0", "x \\ge 8"], "edges": {"directed": true, "multigraph": false, "graph": {}, "nodes": [{"id": "\\sqrt { x - 8 }"}, {"id": "x - 8 \\ge 0"}, {"id": "根式 $\\sqrt { x - 8 }$ 有意义"}, {"id": "二次根式有意义，则根式恒大于等于0"}, {"id": "x \\ge 8"}], "links": [{"rel": "被描述", "source": "\\sqrt { x - 8 }", "target": "x - 8 \\ge 0"}, {"rel": "不等式方程求解", "source": "x - 8 \\ge 0", "target": "x \\ge 8"}, {"rel": "限制性描述", "source": "根式 $\\sqrt { x - 8 }$ 有意义", "target": "x - 8 \\ge 0"}, {"rel": "属性描述", "source": "二次根式有意义，则根式恒大于等于0", "target": "x - 8 \\ge 0"}]}}
+{"content": "If $a ^ { m } \\times a ^ { 2 } = a ^ { 7 }$, then the value of $m$ is ____?", "answer": "5", "steps": "According to the multiplication rule of powers with the same base: when multiplying powers with the same base, keep the base the same and add the exponents. We have $m + 2 = 7$, so solving for $m$ gives $m = 5$.", "expr_cands": ["a ^ { m } \\times a ^ { 2 } = a ^ { 7 }", "a", "m", "m + 2 = 7", "m = 5"], "exprs": ["m + 2 = 7", "m = 5"], "edges": {"directed": true, "multigraph": false, "graph": {}, "nodes": [{"id": "a ^ { m } \\times a ^ { 2 } = a ^ { 7 }"}, {"id": "m + 2 = 7"}, {"id": "m = 5"}], "links": [{"rel": "同取对数", "source": "a ^ { m } \\times a ^ { 2 } = a ^ { 7 }", "target": "m + 2 = 7"}, {"rel": "等式方程求解", "source": "m + 2 = 7", "target": "m = 5"}]}}
+{"content": "If line segment $a$ and $b$ satisfy $\\frac { a } { b } = \\frac { 5 } { 2 }$, then the value of $\\frac { a - b } { b }$ is ____?", "answer": "\\frac { 3 } { 2 }", "steps": "$\\because \\frac { a } { b } = \\frac { 5 } { 2 }$, $\\therefore$ we can assume $a = 5 k$, then $b = 2 k$, $\\therefore \\frac { a - b } { b } = \\frac { 5 k - 2 k } { 2 k } = \\frac { 3 } { 2 }$.", "expr_cands": ["a", "b", "\\frac { a } { b } = \\frac { 5 } { 2 }", "\\frac { a - b } { b }", "a = 5 k", "k", "b = 2 k", "\\frac { 3 } { 2 }"], "exprs": ["a = 5 k", "b = 2 k", "\\frac { 3 } { 2 }"], "edges": {"directed": true, "multigraph": false, "graph": {}, "nodes": [{"id": "\\frac { a } { b } = \\frac { 5 } { 2 }"}, {"id": "a = 5 k"}, {"id": "可设 $a = 5 k$"}, {"id": "线段 $a$ , $b$ 满足 $\\frac { a } { b } = \\frac { 5 } { 2 }$"}, {"id": "b = 2 k"}, {"id": "设b=2k"}, {"id": "\\frac { a - b } { b }"}, {"id": "\\frac { 3 } { 2 }"}], "links": [{"rel": "被描述", "source": "\\frac { a } { b } = \\frac { 5 } { 2 }", "target": "a = 5 k"}, {"rel": "被描述", "source": "\\frac { a } { b } = \\frac { 5 } { 2 }", "target": "b = 2 k"}, {"rel": "代入", "source": "a = 5 k", "target": "\\frac { 3 } { 2 }"}, {"rel": "假设描述", "source": "可设 $a = 5 k$", "target": "a = 5 k"}, {"rel": "限制性描述", "source": "线段 $a$ , $b$ 满足 $\\frac { a } { b } = \\frac { 5 } { 2 }$", "target": "a = 5 k"}, {"rel": "限制性描述", "source": "线段 $a$ , $b$ 满足 $\\frac { a } { b } = \\frac { 5 } { 2 }$", "target": "b = 2 k"}, {"rel": "代入", "source": "b = 2 k", "target": "\\frac { 3 } { 2 }"}, {"rel": "假设描述", "source": "设b=2k", "target": "b = 2 k"}, {"rel": "被代入", "source": "\\frac { a - b } { b }", "target": "\\frac { 3 } { 2 }"}]}}

data/math500/math500_RL.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1686bb35a32b22c862b4c81c4fe8b6923049f2e7c5cb71f5c0c9a1c584258f4b
+size 64102

data/math500_answer_prompt/get_answer_prompt.py

@@ -0,0 +1,24 @@
+import os 
+import json
+
+
+def get_answer_prompt():
+    answer_prompt_data = []
+    with open("/mnt/lyc/wuxinrui/Qwen2.5-Math/evaluation/data/math500/test.jsonl", "r") as f:
+        for line in f:
+            data = json.loads(line)
+            answer = data["answer"]
+            problem = data["problem"]
+            
+            answer_prompt = f"The answer to this question is {answer}. Based on the answer and the constraints of the thought chain length, you should deduce the most logical reasoning process. Note: During the thought process, you should pretend not to have seen the answer, but you must rationally infer the correct answer mentioned earlier based on the content of the thought chain."
+
+            data['problem'] = problem+answer_prompt
+            answer_prompt_data.append(data)
+
+    with open("/mnt/lyc/wuxinrui/Qwen2.5-Math/evaluation/data/math500_answer_prompt/test.jsonl", "w") as f:
+        for data in answer_prompt_data:
+            f.write(json.dumps(data, ensure_ascii=False) + "\n")
+
+if __name__ == "__main__":
+    get_answer_prompt()
+    

data/minerva_math/README.md

@@ -0,0 +1,2 @@
+MIT OpenCourseWare:
+    - Solving Quantitative Reasoning Problems with Language Models. https://openreview.net/forum?id=IFXTZERXdM7

data/trans_parquet.py

@@ -0,0 +1,28 @@
+import pandas as pd 
+import json
+
+
+def trans_parquet(jsonl_path, save_path):
+    with open(jsonl_path, 'r') as f:
+        data = [json.loads(line) for line in f]
+        
+        RL_data_list = []
+        for item in data:
+            QA = {
+                "problem": "Return your final response within \\boxed{}. " + item['problem'],
+                "answer": item['answer'],
+            }
+            RL_data_list.append(QA)
+        RL_data = pd.DataFrame(RL_data_list)
+        RL_data.to_parquet(save_path, index=False)
+
+
+def read_parquet(save_path):
+    data = pd.read_parquet(save_path)
+    print(data.head())
+    return data
+
+if __name__ == "__main__":
+    trans_parquet("/mnt/lyc/wuxinrui/Qwen2.5-Math/evaluation/data/amc23/test.jsonl", "/mnt/lyc/wuxinrui/Qwen2.5-Math/evaluation/data/amc23/amc23.parquet")
+    
+    read_parquet("/mnt/lyc/wuxinrui/Qwen2.5-Math/evaluation/data/amc23/amc23.parquet")

data_loader.py

@@ -0,0 +1,85 @@
+import os
+import json
+import random
+import datasets
+from datasets import load_dataset, Dataset, concatenate_datasets
+from utils import load_jsonl, lower_keys
+
+
+def load_data(data_name, split, data_dir="./data"):
+    data_file = f"{data_dir}/{data_name}/{split}.jsonl"
+    if os.path.exists(data_file):
+        examples = list(load_jsonl(data_file))
+    else:
+        if data_name == "math":
+            dataset = load_dataset(
+                "competition_math",
+                split=split,
+                name="main",
+                cache_dir=f"{data_dir}/temp",
+            )
+        elif data_name == "gsm8k":
+            dataset = load_dataset(data_name, split=split)
+        elif data_name == "svamp":
+            # evaluate on training set + test set
+            dataset = load_dataset("ChilleD/SVAMP", split="train")
+            dataset = concatenate_datasets(
+                [dataset, load_dataset("ChilleD/SVAMP", split="test")]
+            )
+        elif data_name == "asdiv":
+            dataset = load_dataset("EleutherAI/asdiv", split="validation")
+            dataset = dataset.filter(
+                lambda x: ";" not in x["answer"]
+            )  # remove multi-answer examples
+        elif data_name == "mawps":
+            examples = []
+            # four sub-tasks
+            for data_name in ["singleeq", "singleop", "addsub", "multiarith"]:
+                sub_examples = list(load_jsonl(f"{data_dir}/mawps/{data_name}.jsonl"))
+                for example in sub_examples:
+                    example["type"] = data_name
+                examples.extend(sub_examples)
+            dataset = Dataset.from_list(examples)
+        elif data_name == "mmlu_stem":
+            dataset = load_dataset("hails/mmlu_no_train", "all", split="test")
+            # only keep stem subjects
+            stem_subjects = [
+                "abstract_algebra",
+                "astronomy",
+                "college_biology",
+                "college_chemistry",
+                "college_computer_science",
+                "college_mathematics",
+                "college_physics",
+                "computer_security",
+                "conceptual_physics",
+                "electrical_engineering",
+                "elementary_mathematics",
+                "high_school_biology",
+                "high_school_chemistry",
+                "high_school_computer_science",
+                "high_school_mathematics",
+                "high_school_physics",
+                "high_school_statistics",
+                "machine_learning",
+            ]
+            dataset = dataset.rename_column("subject", "type")
+            dataset = dataset.filter(lambda x: x["type"] in stem_subjects)
+        elif data_name == "carp_en":
+            dataset = load_jsonl(f"{data_dir}/carp_en/test.jsonl")
+        else:
+            raise NotImplementedError(data_name)
+
+        examples = list(dataset)
+        examples = [lower_keys(example) for example in examples]
+        dataset = Dataset.from_list(examples)
+        os.makedirs(f"{data_dir}/{data_name}", exist_ok=True)
+        dataset.to_json(data_file)
+
+    # add 'idx' in the first column
+    if "idx" not in examples[0]:
+        examples = [{"idx": i, **example} for i, example in enumerate(examples)]
+
+    # dedepulicate & sort
+    examples = sorted(examples, key=lambda x: x["idx"])
+    return examples

eval_tools.py

@@ -0,0 +1,470 @@
+import os
+def apply_RL_prompt(chunk, args, budget):
+    if args.prompt_type == "deepseek3" and os.environ['tip'] == "Ahead":
+        #### Ahead方法为：在问题的末尾加上remaining。
+        return RL_deepseek3_prompt(chunk, budget)
+    elif args.prompt_type == "deepseek3" and os.environ['tip'] == "prompt":
+        return prompt_format(chunk, budget)
+    elif args.prompt_type == "qwen25-math-cot" and os.environ['tip'] == "prompt":
+        return prompt_format_qw(chunk, budget)
+    elif args.prompt_type == "deepseek3" and os.environ['tip'] == "prompt-based":
+        return deepseek3_prompt_based(chunk, budget)
+    elif args.prompt_type == "deepseek3" and os.environ['tip'] == "prompt-based1":
+        return deepseek3_prompt_based1(chunk, budget)
+    elif args.prompt_type == "deepseek3" and os.environ['tip'] == "prompt-based2":
+        return deepseek3_prompt_based2(chunk, budget)
+    elif args.prompt_type == "deepseek3" and os.environ['tip'] == "prompt-based3":
+        return deepseek3_prompt_based3(chunk, budget)
+    elif os.environ['tip'] == "default":
+        return chunk
+    elif args.prompt_type == "deepseek3" and os.environ['tip'] == "ATD_A" or os.environ['tip'] == "ATD_R":
+        return ATD_A_deepseek3_prompt(chunk, budget)
+    elif args.prompt_type == "deepseek3" and os.environ['tip'] == "TCM": 
+        return TCM_prompt(chunk, budget)
+    elif args.prompt_type == "deepseek3" and os.environ['tip'] == "TCMv2":
+        return TCMv2_prompt(chunk, budget)
+    elif args.prompt_type == "deepseek3" and os.environ['tip'] == "withoutremaining":
+        return withoutremaining_prompt(chunk, budget)
+    elif args.prompt_type == "deepseek3" and os.environ['tip'] == "8ratio":
+        return _8ratio_prompt(chunk, budget)
+    elif args.prompt_type == "deepseek3" and "prompt_v1" in os.environ['tip']:
+        return prompt_v1_prompt(chunk, budget)
+    elif args.prompt_type == "deepseek3" and "prompt_v2" in os.environ['tip']:
+        return prompt_v2_prompt(chunk, budget)
+    elif args.prompt_type == "deepseek3" and "prompt_cod" in os.environ['tip']:
+        return prompt_cod_prompt(chunk, budget)
+    elif args.prompt_type == "deepseek3" and "prompt_c2f" in os.environ['tip']:
+        return prompt_c2f_prompt(chunk, budget)
+    elif args.prompt_type == "deepseek3" and os.environ['tip'] == "Laser":
+        return Laser_prompt(chunk, budget)
+    elif args.prompt_type == "deepseek3" and os.environ['tip'] == "TCM+":
+        return TCMv2_prompt(chunk, budget)
+    elif args.prompt_type == "deepseek3" and os.environ['tip'] == "SST":
+        return SST_prompt(chunk, budget)
+    elif args.prompt_type == "deepseek3" and os.environ['tip'] == "Tokenskip":
+        return Tokenskip_prompt(chunk, budget)
+    elif args.prompt_type == "deepseek3" and os.environ['tip'] == "thinkprune":
+        return thinkprune_prompt(chunk, budget)
+    else:
+        return chunk
+
+
+
+
+
+def Tokenskip_prompt(chunk, budget):
+    find_strings = "<｜Assistant｜>"
+    alpha = os.environ['alpha']
+    for i in range(len(chunk)):
+        head = chunk[i].split(find_strings)[0]
+        tail = chunk[i].split(find_strings)[1]
+        add_prompt = f'<｜end▁of▁sentence｜>{alpha}<｜end▁of▁sentence｜>'
+        chunk[i] = head + add_prompt + find_strings + tail
+    return chunk
+    
+
+def SST_prompt(chunk, budget):
+    find_strings = "<｜Assistant｜>"
+    up_to_50 = budget // 50 + 1
+    N = up_to_50
+    for i in range(len(chunk)):
+        head = chunk[i].split(find_strings)[0]
+        tail = chunk[i].split(find_strings)[1]
+        # add_prompt = f'\n(Complete thinking within {budget} tokens or fewer.)'
+        # add_prompt = f'\n(Complete thinking within {budget} tokens or fewer.)\n<remaining>{budget}</remaining>\n'
+        add_prompt = f"\n(Complete thinking within {N} <countdown> or fewer.)"
+        # add_prompt = f'\n<remaining>{budget}</remaining>\n'
+
+        add_response = "\n<think>\n\n<countdown>\n"
+        # head += f"\n<remaining>{budget}</remaining>\n"
+        chunk[i] = head + add_prompt + find_strings + tail + add_response
+        # print(f"chunk[i] = {chunk[i]}")
+    return chunk
+
+
+def TCMv2_prompt(chunk, budget):
+    find_strings = "<｜Assistant｜>"
+    for i in range(len(chunk)):
+        head = chunk[i].split(find_strings)[0]
+        tail = chunk[i].split(find_strings)[1]
+        # add_prompt = f'\n(Complete thinking within {budget} tokens or fewer.)'
+        # add_prompt = f'\n(Complete thinking within {budget} tokens or fewer.)\n<remaining>{budget}</remaining>\n'
+        add_prompt = f"\n(Complete thinking within \n<remaining>{budget}</remaining>\n tokens or fewer.)"
+        # add_prompt = f'\n<remaining>{budget}</remaining>\n'
+
+        add_response = f""
+        # head += f"\n<remaining>{budget}</remaining>\n"
+        chunk[i] = head + add_prompt + find_strings + add_response + tail
+        # print(f"chunk[i] = {chunk[i]}")
+    return chunk
+
+
+
+def withoutremaining_prompt(chunk, budget):
+    find_strings = "<｜Assistant｜>"
+    for i in range(len(chunk)):
+        head = chunk[i].split(find_strings)[0]
+        tail = chunk[i].split(find_strings)[1]
+        # add_prompt = f'\n(Complete thinking within {budget} tokens or fewer.)'
+        # add_prompt = f'\n(Complete thinking within {budget} tokens or fewer.)\n<remaining>{budget}</remaining>\n'
+        add_prompt = f"\n(Complete thinking within {budget} tokens or fewer.)"
+        # add_prompt = f'\n<remaining>{budget}</remaining>\n'
+
+        add_response = f""
+        # head += f"\n<remaining>{budget}</remaining>\n"
+        chunk[i] = head + add_prompt + find_strings + add_response + tail
+        # print(f"chunk[i] = {chunk[i]}")
+    return chunk
+
+def _8ratio_prompt(chunk, budget):
+    os.environ['budget'] = str(budget)
+    print(f"budget = {budget}")
+    find_strings = "<｜Assistant｜>"
+    for i in range(len(chunk)):
+        head = chunk[i].split(find_strings)[0]
+        tail = chunk[i].split(find_strings)[1]
+        # add_prompt = f'\n(Complete thinking within {budget} tokens or fewer.)'
+        add_prompt = f"\n(Complete thinking within {budget} tokens or fewer, 7 special tokens ( \n<remaining>7/8</remaining>\n , \n<remaining>6/8</remaining>\n , \n<remaining>5/8</remaining>\n , \n<remaining>4/8</remaining>\n , \n<remaining>3/8</remaining>\n , \n<remaining>2/8</remaining>\n , \n<remaining>1/8</remaining>\n ) will split the thinking process into 8 parts.)"
+        
+        add_response = f""
+
+        chunk[i] = head + add_prompt + find_strings + add_response + tail
+        
+    return chunk
+
+def Laser_prompt(chunk, budget):
+    os.environ['budget'] = str(budget)
+    print(f"budget = {budget}")
+    find_strings = "<｜Assistant｜>"
+    for i in range(len(chunk)):
+        head = chunk[i].split(find_strings)[0]
+        tail = chunk[i].split(find_strings)[1]
+        add_prompt = "Please reason step by step, and put your final answer within \\boxed{}"
+        add_response = f""
+
+        chunk[i] = head + add_prompt + find_strings + add_response + tail
+    return chunk
+
+def prompt_v1_prompt(chunk, budget):
+    os.environ['budget'] = str(budget)
+    print(f"budget = {budget}")
+    find_strings = "<｜Assistant｜>"
+    for i in range(len(chunk)):
+        head = chunk[i].split(find_strings)[0]
+        tail = chunk[i].split(find_strings)[1]
+        # add_prompt = f'\n(Complete thinking within {budget} tokens or fewer.)'
+        add_prompt = f"\n(Complete thinking within {budget} tokens or fewer, please output the remaining number of tokens every 200 tokens to facilitate control of the remaining length of the thinking process, here is a template: 'now remaining tokens: xxx', xxx is the real remaining number of tokens.)"
+        add_response = f""
+
+        chunk[i] = head + add_prompt + find_strings + add_response + tail
+        
+    return chunk
+
+def prompt_v2_prompt(chunk, budget):
+    os.environ['budget'] = str(budget)
+    print(f"budget = {budget}")
+    find_strings = "<｜Assistant｜>"
+    for i in range(len(chunk)):
+        head = chunk[i].split(find_strings)[0]
+        tail = chunk[i].split(find_strings)[1]
+        # add_prompt = f'\n(Complete thinking within {budget} tokens or fewer.)'
+        add_prompt = f"\n(Complete thinking within {budget} tokens or fewer)"
+        add_response = f""
+
+        chunk[i] = head + add_prompt + find_strings + add_response + tail
+        
+    return chunk
+
+def prompt_cod_prompt(chunk, budget):
+    os.environ['budget'] = str(budget)
+    print(f"budget = {budget}")
+    find_strings = "<｜Assistant｜>"
+    for i in range(len(chunk)):
+        head = chunk[i].split(find_strings)[0]
+        tail = chunk[i].split(find_strings)[1]
+        # add_prompt = f'\n(Complete thinking within {budget} tokens or fewer.)'
+        add_prompt = f'''
+        Please solve the following math problem step by step, but only record the most essential steps during the reasoning process. Each step should be concise and clear, focusing directly on the core calculation or logical transformation. No detailed explanation is needed; just write down the key derivations. After completing the reasoning, provide the final answer after.
+
+        Example:
+        Problem: Jason has 20 lollipops. After giving some to Denny, he now has 12 left. How many did he give to Denny?
+        Reasoning:
+        20 - x = 12  
+        x = 20 - 12  
+        x = 8  
+        8
+        Now please solve the above problem.\n(Complete thinking within {budget} tokens or fewer)
+        '''
+        add_response = f""
+
+        chunk[i] = head + add_prompt + find_strings + add_response + tail
+        
+    return chunk
+
+def prompt_c2f_prompt(chunk, budget):
+    os.environ['budget'] = str(budget)
+    print(f"budget = {budget}")
+    find_strings = "<｜Assistant｜>"
+    for i in range(len(chunk)):
+        head = chunk[i].split(find_strings)[0]
+        tail = chunk[i].split(find_strings)[1]
+        # add_prompt = f'\n(Complete thinking within {budget} tokens or fewer.)'
+        add_prompt = f'''
+        Use the following pattern to solve the problem:
+
+        **Coarse-Grained Reasoning**
+        Provide a brief analysis and initial answer, focusing
+        on efficiency and conciseness.
+
+        **Fine-Grained Reasoning**
+        Provide detailed reasoning step by step and a refined
+        answer, focusing on correctness and rigor.
+
+        Conclude with:
+        Therefore, the final answer is: \\boxed{{[answer]}}.
+        Where [answer] is just the final number or expression
+        that solves the problem.
+
+        Now please solve the above problem.\n(Complete thinking within {budget} tokens or fewer)
+        '''
+        add_response = f""
+
+        chunk[i] = head + add_prompt + find_strings + add_response + tail
+        
+    return chunk
+
+
+
+
+def thinkprune_prompt(chunk, budget):
+    SYSTEM_PROMPT = (
+    "A conversation between User and Assistant. The user asks a question, "
+    "and the Assistant solves it."
+    " The assistant first thinks about the reasoning process in the mind and then provides the user"
+    " with the answer. The reasoning process and answer are enclosed within <think></think> and"
+    " <answer></answer> tags, respectively, i.e., <think> reasoning process here</think>"
+    "<answer> answer here</answer>."
+    )
+    find_strings = "<｜Assistant｜>"
+    for i in range(len(chunk)):
+        head = chunk[i].split(find_strings)[0]
+        tail = chunk[i].split(find_strings)[1]
+        # add_prompt = f'\n(Complete thinking within {budget} tokens or fewer.)'
+        # add_prompt = f'\n(Complete thinking within {budget} tokens or fewer.)\n<remaining>{budget}</remaining>\n'
+        add_prompt = SYSTEM_PROMPT + f"The output of the assistant should be within {budget} tokens"
+        # add_prompt = f'\n<remaining>{budget}</remaining>\n'
+
+        add_response = f""
+        # head += f"\n<remaining>{budget}</remaining>\n"
+        chunk[i] = head + add_prompt + find_strings + add_response + tail
+        # print(f"chunk[i] = {chunk[i]}")
+    return chunk
+
+def TCM_prompt(chunk, budget):
+    find_strings = "<｜Assistant｜>"
+    for i in range(len(chunk)):
+        head = chunk[i].split(find_strings)[0]
+        tail = chunk[i].split(find_strings)[1]
+        # add_prompt = f'\n(Complete thinking within {budget} tokens or fewer.)'
+        add_prompt = f"\n(Complete thinking within \n<remaining>{budget}</remaining>\n tokens or fewer.)"
+        # add_prompt = f'\n(Complete thinking within {budget} tokens or fewer.)\n<remaining>{budget}</remaining>\n'
+        # add_prompt = f'\n<remaining>{budget}</remaining>\n'
+        add_response = f""
+        # head += f"\n<remaining>{budget}</remaining>\n"
+        chunk[i] = head + add_prompt + find_strings + add_response + tail
+        # print(f"chunk[i] = {chunk[i]}")
+    return chunk
+
+
+def prompt_format(chunk, budget):
+    '''
+     <｜User｜>Convert the point $(0,3)$ in rectangular coordinates to polar coordinates. 
+     Enter your answer in the form $(r,\theta),$ where $r > 0$ and $0 \le \theta < 2 \pi.$
+     <｜Assistant｜>
+    '''
+    find_strings = "<｜Assistant｜>"
+    for i in range(len(chunk)):
+        head = chunk[i].split(find_strings)[0]
+        tail = chunk[i].split(find_strings)[1]
+        head += f"\n(Complete thinking within {budget} tokens or fewer.)\n"
+        chunk[i] = head + find_strings + tail
+    return chunk
+
+
+def prompt_format_qw(chunk, budget):
+    '''
+     <｜User｜>Convert the point $(0,3)$ in rectangular coordinates to polar coordinates. 
+     Enter your answer in the form $(r,\theta),$ where $r > 0$ and $0 \le \theta < 2 \pi.$
+     <｜Assistant｜>
+    '''
+    find_strings = "<|im_start|>assistant"
+
+    for i in range(len(chunk)):
+        head = chunk[i].split(find_strings)[0]
+        tail = chunk[i].split(find_strings)[1]
+        head += f"\n(Complete thinking within {budget} tokens or fewer.)\n"
+        chunk[i] = head + find_strings + tail
+    return chunk
+
+
+
+
+
+def ATD_A_deepseek3_prompt(chunk, budget):
+    find_strings = "<｜Assistant｜>"
+    for i in range(len(chunk)):
+        head = chunk[i].split(find_strings)[0]
+        tail = chunk[i].split(find_strings)[1]
+        add_prompt = f'\n(Respond in {budget} tokens or fewer. Complete the process between <think> and </think> within the token budget. Display the countdown exponentially as <remaining>xxx</remaining>, where xxx = 50 * 2^n, n >= 0. Think more concisely as countdown decreases.)\n'
+        add_response = f"\n(I will complete the process within {budget} tokens and show the countdown as <remaining>xxx</remaining>, following the exponential rule.I will think more concisely as countdown decreases.)\n"
+        # head += f"\n<remaining>{budget}</remaining>\n"
+        chunk[i] = head + add_prompt + find_strings + add_response + tail
+    return chunk
+
+
+
+
+def RL_deepseek3_prompt(chunk, budget):
+    '''
+     <｜User｜>Convert the point $(0,3)$ in rectangular coordinates to polar coordinates. 
+     Enter your answer in the form $(r,\theta),$ where $r > 0$ and $0 \le \theta < 2 \pi.$
+     <｜Assistant｜>
+    '''
+    find_strings = "<｜Assistant｜>"
+    for i in range(len(chunk)):
+        head = chunk[i].split(find_strings)[0]
+        tail = chunk[i].split(find_strings)[1]
+        head += f"(Please respond in {budget} tokens or fewer)\n"
+        # head += f"\n<remaining>{budget}</remaining>\n"
+        chunk[i] = head + find_strings + tail
+    return chunk
+        
+    
+def deepseek3_prompt_based(chunk, budget):
+    '''
+     <｜User｜>Convert the point $(0,3)$ in rectangular coordinates to polar coordinates. 
+     Enter your answer in the form $(r,\theta),$ where $r > 0$ and $0 \le \theta < 2 \pi.$
+     <｜Assistant｜>
+    '''
+    find_strings = "<｜Assistant｜>"
+    for i in range(len(chunk)):
+        head = chunk[i].split(find_strings)[0]
+        tail = chunk[i].split(find_strings)[1]
+        head += f"You should finish thinking with in {budget} tokens.\n"
+        chunk[i] = head + find_strings + tail
+    return chunk
+    
+
+def deepseek3_prompt_based1(chunk, budget):
+    '''
+     <｜User｜>Convert the point $(0,3)$ in rectangular coordinates to polar coordinates. 
+     Enter your answer in the form $(r,\theta),$ where $r > 0$ and $0 \le \theta < 2 \pi.$
+     <｜Assistant｜>
+    '''
+    find_strings = "<｜Assistant｜>"
+    for i in range(len(chunk)):
+        head = chunk[i].split(find_strings)[0]
+        tail = chunk[i].split(find_strings)[1]
+        head += f"(Please respond in {budget} tokens or fewer)\n"
+        chunk[i] = head + find_strings + tail
+    return chunk
+
+
+
+def deepseek3_prompt_based2(chunk, budget):
+    '''
+     <｜User｜>Convert the point $(0,3)$ in rectangular coordinates to polar coordinates. 
+     Enter your answer in the form $(r,\theta),$ where $r > 0$ and $0 \le \theta < 2 \pi.$
+     <｜Assistant｜>
+    '''
+    find_strings = "<｜Assistant｜>"
+    for i in range(len(chunk)):
+        head = chunk[i].split(find_strings)[0]
+        tail = chunk[i].split(find_strings)[1]
+        head += f"(HARD STOP at {budget} tokens)\n"
+        chunk[i] = head + find_strings + tail
+    return chunk
+
+
+def deepseek3_prompt_based3(chunk, budget):
+    '''
+     <｜User｜>Convert the point $(0,3)$ in rectangular coordinates to polar coordinates. 
+     Enter your answer in the form $(r,\theta),$ where $r > 0$ and $0 \le \theta < 2 \pi.$
+     <｜Assistant｜>
+    '''
+    find_strings = "<｜Assistant｜>"
+    for i in range(len(chunk)):
+        head = chunk[i].split(find_strings)[0]
+        tail = chunk[i].split(find_strings)[1]
+        head += f"(Response length limit: Strictly {budget} tokens max. Budget cannot be exceeded)\n"
+        chunk[i] = head + find_strings + tail
+    return chunk
+
+
+    
+    
+    
+# def solve_final_answer(chunk):
+#     k = 0
+#     for i in range(len(chunk)):
+#         if "**Final Answer**\\boxed" in chunk[i][:-10] and "<｜end▁of▁sentence｜>" not in chunk[i]:
+#             chunk[i] += "<｜end▁of▁sentence｜>"
+#             k += 1
+#     print(f"###added {k} final answer!")
+#     return chunk
+
+# import re
+
+def is_balanced(s: str) -> bool:
+    """验证大括号是否成对且正确嵌套"""
+    stack = 0
+    for char in s:
+        if char == "{":
+            stack += 1
+        elif char == "}":
+            stack -= 1
+            if stack < 0:
+                return False
+    return stack == 0
+
+def solve_final_answer(chunk: list) -> list:
+    
+    """处理包含嵌套大括号的答案匹配"""
+    
+    end_chunk = []
+    open_chunk = []
+    
+    k = 0
+    pattern = "**Final Answer**\\boxed{"  # 初级匹配
+    
+    for i in range(len(chunk)):
+        line = chunk[i]
+        if not pattern in line:
+            open_chunk.append(chunk[i])
+            continue
+        # 深度扫描完整结构
+        start_idx = line.find('**Final Answer**\\boxed{')
+        if start_idx == -1:
+            open_chunk.append(chunk[i])
+            continue
+        # 手动解析嵌套结构
+        stack = 1
+        end_idx = start_idx + len('**Final Answer**\\boxed{')
+        while end_idx < len(line) and stack > 0:
+            if line[end_idx] == "{":
+                stack += 1
+            elif line[end_idx] == "}":
+                stack -= 1
+            end_idx += 1
+        
+        # 验证闭合状态
+        if stack == 0 and is_balanced(line[start_idx:end_idx]):
+            
+            chunk[i] += "<｜end▁of▁sentence｜>"  # 保持原有操作
+            k += 1
+            end_chunk.append(chunk[i])
+        else:
+            open_chunk.append(chunk[i])
+
+    print(f"### Find {k} anwsers have final answer!")
+    return chunk, end_chunk, open_chunk

evaluate.py

@@ -0,0 +1,117 @@
+import argparse
+import numpy as np
+from tqdm import tqdm
+from pebble import ProcessPool
+from concurrent.futures import TimeoutError
+
+from grader import *
+
+from parser import *
+from utils import load_jsonl
+from python_executor import PythonExecutor
+
+
+def evaluate(data_name, prompt_type, samples: list=None, file_path: str=None, max_num_samples=None, execute=False):
+    assert samples or file_path, "samples or file_path must be provided"
+    if not samples:
+        samples = list(load_jsonl(file_path))
+    if 'idx' in samples[0]:
+        samples = {sample['idx']: sample for sample in samples}.values()
+        samples = sorted(samples, key=lambda x: x['idx']) 
+    else:
+        samples = [dict(idx=idx, **sample) for idx, sample in enumerate(samples)]
+
+    if max_num_samples:
+        print(f"max_num_samples: {max_num_samples} / {len(samples)}")
+        samples = samples[:max_num_samples]
+    
+    # parse gt
+    for sample in samples:
+        sample['gt_cot'], sample['gt'] = parse_ground_truth(sample, data_name)
+    params = [(idx, pred, sample['gt']) for idx, sample in enumerate(samples) for pred in sample['pred']]
+
+    scores = []
+    timeout_cnt = 0 
+
+    with ProcessPool(max_workers=1) as pool:
+        future = pool.map(math_equal_process, params, timeout=3)
+        iterator = future.result()
+        with tqdm(total=len(samples), desc="Evaluate") as progress_bar:
+            while True:
+                try:
+                    result = next(iterator)
+                    scores.append(result)
+                except StopIteration:
+                    break
+                except TimeoutError as error:
+                    print(error)
+                    scores.append(False)
+                    timeout_cnt += 1
+                except Exception as error:
+                    print(error.traceback)
+                    exit()
+                progress_bar.update(1) 
+
+    idx = 0
+    score_mat = []
+    print(f"sample['pred'] = {sample['pred']}")
+    accu = 0
+    for score in scores:
+        if score:
+            accu += 1
+    simple_acc = accu / len(scores) * 100
+    print(f"simple_acc = {simple_acc}, true samples = {accu}")
+    for sample in samples:
+        sample['score'] = scores[idx: idx+len(sample['pred'])]
+        assert len(sample['score']) == len(sample['pred'])
+        score_mat.append(sample['score'])
+        idx += len(sample['pred'])
+
+    max_len = max([len(s) for s in score_mat])
+
+    for i, s in enumerate(score_mat):
+        if len(s) < max_len:
+            score_mat[i] = s + [s[-1]] * (max_len - len(s)) # pad
+
+    # output mean of each column of scores
+    col_means= np.array(score_mat).mean(axis=0)
+    mean_score = list(np.round(col_means * 100, decimals=1))
+
+    result_json = {
+        "num_samples": len(samples),
+        "num_scores": len(scores),
+        "timeout_samples": timeout_cnt,
+        "empty_samples": len([s for s in samples if not s['pred'][-1]]),
+        "acc": mean_score[0],
+        "simple_acc": simple_acc,
+    }
+
+    # each type score
+    if "type" in samples[0]:
+        type_scores = {}
+        for sample in samples:
+            if sample['type'] not in type_scores:
+                type_scores[sample['type']] = []
+            type_scores[sample['type']].append(sample['score'][-1])
+        type_scores = {k: np.round(np.array(v).mean() * 100, decimals=1) for k, v in type_scores.items()}
+        type_scores = {k: v for k, v in sorted(type_scores.items(), key=lambda item: item[0])}
+        result_json['type_acc'] = type_scores
+
+    print(result_json)
+    return samples, result_json
+
+
+def parse_args():
+    parser = argparse.ArgumentParser()
+    parser.add_argument("--data_name", type=str, default="math")
+    parser.add_argument("--prompt_type", type=str, default="tool-integrated")
+    parser.add_argument("--file_path", type=str, default=None, required=True)
+    parser.add_argument("--max_num_samples", type=int, default=None)
+    parser.add_argument("--execute", action="store_true")
+    args = parser.parse_args()
+    return args
+
+if __name__ == "__main__":
+    args = parse_args()
+    evaluate(data_name=args.data_name, prompt_type=args.prompt_type, file_path=args.file_path,
+             max_num_samples=args.max_num_samples, execute=args.execute)

examples.py

@@ -0,0 +1,378 @@
+import json
+
+
+def get_examples():
+    examples = {}
+    examples["gsm8k"] = [
+        (
+            "There are 15 trees in the grove. Grove workers will plant trees in the grove today. After they are done, there will be 21 trees. How many trees did the grove workers plant today?",
+            "There are 15 trees originally. Then there were 21 trees after some more were planted. So there must have been 21 - 15 = 6. The answer is 6.",
+        ),
+        (
+            "If there are 3 cars in the parking lot and 2 more cars arrive, how many cars are in the parking lot?",
+            "There are originally 3 cars. 2 more cars arrive. 3 + 2 = 5. The answer is 5.",
+        ),
+        (
+            "Leah had 32 chocolates and her sister had 42. If they ate 35, how many pieces do they have left in total?",
+            "Originally, Leah had 32 chocolates. Her sister had 42. So in total they had 32 + 42 = 74. After eating 35, they had 74 - 35 = 39. The answer is 39.",
+        ),
+        (
+            "Jason had 20 lollipops. He gave Denny some lollipops. Now Jason has 12 lollipops. How many lollipops did Jason give to Denny?",
+            "Jason started with 20 lollipops. Then he had 12 after giving some to Denny. So he gave Denny 20 - 12 = 8. The answer is 8.",
+        ),
+        (
+            "Shawn has five toys. For Christmas, he got two toys each from his mom and dad. How many toys does he have now?",
+            "Shawn started with 5 toys. If he got 2 toys each from his mom and dad, then that is 4 more toys. 5 + 4 = 9. The answer is 9.",
+        ),
+        (
+            "There were nine computers in the server room. Five more computers were installed each day, from monday to thursday. How many computers are now in the server room?",
+            "There were originally 9 computers. For each of 4 days, 5 more computers were added. So 5 * 4 = 20 computers were added. 9 + 20 is 29. The answer is 29.",
+        ),
+        (
+            "Michael had 58 golf balls. On tuesday, he lost 23 golf balls. On wednesday, he lost 2 more. How many golf balls did he have at the end of wednesday?",
+            "Michael started with 58 golf balls. After losing 23 on tuesday, he had 58 - 23 = 35. After losing 2 more, he had 35 - 2 = 33 golf balls. The answer is 33.",
+        ),
+        (
+            "Olivia has $23. She bought five bagels for $3 each. How much money does she have left?",
+            "Olivia had 23 dollars. 5 bagels for 3 dollars each will be 5 x 3 = 15 dollars. So she has 23 - 15 dollars left. 23 - 15 is 8. The answer is 8.",
+        ),
+    ]
+    examples["gsm8k-pal"] = [
+        (
+            "Olivia has $23. She bought five bagels for $3 each. How much money does she have left?",
+            '```python\ndef solution():\n    """Olivia has $23. She bought five bagels for $3 each. How much money does she have left?"""\n    money_initial = 23\n    bagels = 5\n    bagel_cost = 3\n    money_spent = bagels * bagel_cost\n    money_left = money_initial - money_spent\n    result = money_left\n    return result\n```',
+        ),
+        (
+            "Michael had 58 golf balls. On tuesday, he lost 23 golf balls. On wednesday, he lost 2 more. How many golf balls did he have at the end of wednesday?",
+            '```python\ndef solution():\n    """Michael had 58 golf balls. On tuesday, he lost 23 golf balls. On wednesday, he lost 2 more. How many golf balls did he have at the end of wednesday?"""\n    golf_balls_initial = 58\n    golf_balls_lost_tuesday = 23\n    golf_balls_lost_wednesday = 2\n    golf_balls_left = golf_balls_initial - golf_balls_lost_tuesday - golf_balls_lost_wednesday\n    result = golf_balls_left\n    return result\n```',
+        ),
+        (
+            "There were nine computers in the server room. Five more computers were installed each day, from monday to thursday. How many computers are now in the server room?",
+            '```python\ndef solution():\n    """There were nine computers in the server room. Five more computers were installed each day, from monday to thursday. How many computers are now in the server room?"""\n    computers_initial = 9\n    computers_per_day = 5\n    num_days = 4  # 4 days between monday and thursday\n    computers_added = computers_per_day * num_days\n    computers_total = computers_initial + computers_added\n    result = computers_total\n    return result\n```',
+        ),
+    ]
+    examples["gsm8k-tora"] = [
+        (
+            "Olivia has $23. She bought five bagels for $3 each. How much money does she have left?",
+            "```python\ndef money_left():\n    money_initial = 23\n    bagels = 5\n    bagel_cost = 3\n    money_spent = bagels * bagel_cost\n    remaining_money = money_initial - money_spent\n    return remaining_money\n \nremaining_money = money_left()\nprint(remaining_money)\n```\n```output\n8\n```\nOlivia has $\\boxed{8}$ dollars left.",
+        ),
+        (
+            "Michael had 58 golf balls. On tuesday, he lost 23 golf balls. On wednesday, he lost 2 more. How many golf balls did he have at the end of wednesday?",
+            "```python\ndef remaining_golf_balls():\n    golf_balls_initial = 58\n    golf_balls_lost_tuesday = 23\n    golf_balls_lost_wednesday = 2\n    golf_balls_left = golf_balls_initial - golf_balls_lost_tuesday - golf_balls_lost_wednesday\n    remaining_golf_balls = golf_balls_left\n    return remaining_golf_balls\n\nanswer = remaining_golf_balls() \nprint(answer)\n```\n```output\n33\n```\nMichael had $\\boxed{33}$ golf balls at the end of Wednesday.",
+        ),
+        (
+            "There were nine computers in the server room. Five more computers were installed each day, from monday to thursday. How many computers are now in the server room?",
+            "```python\ndef total_computers():\n    computers_initial = 9\n    computers_per_day = 5\n    num_days = 4  # 4 days between monday and thursday\n    computers_added = computers_per_day * num_days\n    computers_total = computers_initial + computers_added\n    return computers_total\n\ntotal_computers = total_computers()\nprint(total_computers)\n```\n```output\n29\n```\nThere're $\\boxed{29}$ computers in the server room.",
+        ),
+    ]
+
+    examples["math"] = [
+        (
+            "Kevin Kangaroo begins hopping on a number line at 0. He wants to get to 1, but he can hop only $\\frac{1}{3}$ of the distance. Each hop tires him out so that he continues to hop $\\frac{1}{3}$ of the remaining distance. How far has he hopped after five hops? Express your answer as a common fraction.",
+            "Let's think step by step\nKevin hops $1/3$ of the remaining distance with every hop.\nHis first hop takes $1/3$ closer.\nFor his second hop, he has $2/3$ left to travel, so he hops forward $(2/3)(1/3)$.\nFor his third hop, he has $(2/3)^2$ left to travel, so he hops forward $(2/3)^2(1/3)$.\nIn general, Kevin hops forward $(2/3)^{k-1}(1/3)$ on his $k$th hop.\nWe want to find how far he has hopped after five hops.\nThis is a finite geometric series with first term $1/3$, common ratio $2/3$, and five terms.\nThus, Kevin has hopped $\\frac{\\frac{1}{3}\\left(1-\\left(\\frac{2}{3}\\right)^5\\right)}{1-\\frac{2}{3}} = \\boxed{\\frac{211}{243}}$.\nThe answer is \\frac{211}{243}}",
+        ),
+        (
+            "What is the area of the region defined by the equation $x^2+y^2 - 7 = 4y-14x+3$?",
+            "Let's think step by step\nWe rewrite the equation as $x^2 + 14x + y^2 - 4y = 10$ and then complete the square,\nresulting in  $(x+7)^2-49 + (y-2)^2-4=10$,\nor $(x+7)^2+(y-2)^2=63$.\nThis is the equation of a circle with center $(-7, 2)$ and radius $\\sqrt{63},$\nso the area of this region is $\\pi r^2 = \\boxed{63\\pi}$.\nThe answer is 63\\pi",
+        ),
+        (
+            "If $x^2+y^2=1$, what is the largest possible value of $|x|+|y|$?",
+            "Let's think step by step\nIf $(x,y)$ lies on the circle,\nso does $(x,-y),$ $(-x,-y),$ and $(-x,-y),$ (which all give the same value of $|x| + |y|$),\nso we can assume that $x \\ge 0$ and $y \\ge 0.$\nThen $|x| + |y| = x + y.$  Squaring, we get\n\\[(x + y)^2 = x^2 + 2xy + y^2 = 1 + 2xy.\\]\nNote that $(x - y)^2 \\ge 0.$\nExpanding, we get $x^2 - 2xy + y^2 \\ge 0,$ so $2xy \\le x^2 + y^2 = 1.$\nHence,\\[1 + 2xy \\le 2,\\]which means $x + y \\le \\sqrt{2}.$\nEquality occurs when $x = y = \\frac{1}{\\sqrt{2}},$\nso the maximum value of $|x| + |y|$ is $\\boxed{\\sqrt{2}}.$\nThe answer is \\sqrt{2}",
+        ),
+        (
+            "If $f(x)=\\frac{ax+b}{cx+d}, abcd\\not=0$ and $f(f(x))=x$ for all $x$ in the domain of $f$, what is the value of $a+d$?",
+            "Let's think step by step\nThe condition $f(f(x))$ means that $f$ is the inverse of itself,\nso its graph is symmetrical about the line $y = x$.\nWith a rational function of this form, we will have two asymptotes:\na vertical one at $x=-d/c$ if $cx+d$ does not divide $ax+b$,\nand a horizontal one at $y=a/c$,\nif we take the limit of $f(x)$ as $x$ goes to $\\pm\\infty$.\nIn order for $f$ to be its own inverse, the intersection of the asymptotes must lie on the line $y=x$\nso that it and its asymptotes reflect onto themselves.\nThis means that $-d/c=a/c$,\nand therefore $-d=a$ and $a+d=\\boxed{0}$.\nThe answer is 0",
+        ),
+        (
+            "Expand $(2z^2 + 5z - 6)(3z^3 - 2z + 1)$.",
+            "Let's think step by step\n$$\\begin{array}{crrrrrrr}\n& & & 3z^3 & & -2z & + 1 & \\\\\n\\times & & & & 2z^2 & +5z & -6 \\\\\n\\cline{1-7}\\rule{0pt}{0.17in}\n& & & -18z^3 & & +12z & -6 & \\\\\n& & +15z^4 & & -10z^2 & +5z & & \\\\\n+ & 6z^5 & & -4z^3 & +2z^2 & & & \\\\\n\\cline{1-7}\\rule{0pt}{0.17in}\n& 6z^5 & +15z^4 & -22z^3 & - 8z^2 &+17z & -6 &\n\\end{array}$$\nThe answer is 6z^5+15z^4-22z^3-8z^2+17z-6",
+        ),
+    ]
+
+    examples["math_pal"] = [
+        (
+            "Display the final result in LaTeX.\n\n Find the coefficient of $x^3$ when $3(x^2 - x^3+x) +3(x +2x^3- 3x^2 + 3x^5+x^3) -5(1+x-4x^3 - x^2)$ is simplifie.",
+            "```python\nfrom sympy import symbols, simplify\n\ndef solution():\n    x = symbols('x')\n    expr = 3*(x**2 - x**3 + x) + 3*(x + 2*x**3 - 3*x**2 + 3*x**5 + x**3) - 5*(1 + x - 4*x**3 - x**2)\n    simplified_expr = simplify(expr)\n\n    x3_coefficient = simplified_expr.as_coefficients_dict()[x**3]\n    result = x3_coefficient\n    return result\n```",
+        ),
+        (
+            "The surface area of a sphere with radius $r$ is $4\\pi r^2$. Including the area of its circular base, what is the total surface area of a hemisphere with radius 6 cm? Express your answer in terms of $\\pi$.",
+            "```python\nimport math\n\ndef solution():\n    radius = 6\n\n    # Surface area of the hemisphere\n    hemisphere_area = 2 * math.pi * radius**2\n\n    # Area of the circular base\n    base_area = math.pi * radius**2\n\n    # Total surface area\n    total_surface_area = hemisphere_area + base_area\n\n    # Formatting the result in LaTeX\n    result = r'{}\\\\pi'.format(total_surface_area / math.pi)\n    return result\n```",
+        ),
+        (
+            "Monica tosses a fair 6-sided die.  If the roll is a prime number, then she wins that amount of dollars (so that, for example, if she rolls 3, then she wins 3 dollars).  If the roll is composite, she wins nothing. Otherwise, she loses 3 dollars. What is the expected value of her winnings on one die toss? Express your answer as a dollar value to the nearest cent.",
+            '```python\ndef solution():\n    # Probabilities of each outcome\n    prime_prob = 1 / 6\n    composite_prob = 1 / 3\n    otherwise_prob = 1 / 6\n\n    # Expected value of each outcome\n    prime_expected_value = (2 * prime_prob) + (3 * prime_prob) + (5 * prime_prob)\n    composite_expected_value = 0 * composite_prob\n    otherwise_expected_value = -3 * otherwise_prob\n\n    # Total expected value\n    total_expected_value = prime_expected_value + composite_expected_value + otherwise_expected_value\n\n    # Dollar value to the nearest cent\n    result = "{:.2f}".format(total_expected_value)\n    return result\n```',
+        ),
+        (
+            "Given $\\mathbf{a} = \\begin{pmatrix} -7 \\\\ 0 \\\\ 1 \\end{pmatrix}$ and $\\mathbf{b} = \\begin{pmatrix} 4 \\\\ 2 \\\\ -1 \\end{pmatrix},$ find $\\mathbf{a} - 3 \\mathbf{b}.$",
+            "```python\nimport numpy as np\n\ndef solution()\n    a = np.array([-7, 0, 1])\n    b = np.array([4, 2, -1])\n\n    result = a - 3 * b\n\n    result = r'\\begin{{pmatrix}} {} \\\\ {} \\\\ {} \\end{{pmatrix}}'.format(result[0], result[1], result[2])\n    return result\n```",
+        ),
+    ]
+    examples["math-tora"] = [
+        (
+            "Convert the point $(0, -3 \\sqrt{3}, 3)$ in rectangular coordinates to spherical coordinates.  Enter your answer in the form $(\\rho,\\theta,\\phi),$ where $\\rho > 0,$ $0 \\le \\theta < 2 \\pi,$ and $0 \\le \\phi \\le \\pi.$",
+            "To convert the point $(x, y, z)$ in rectangular coordinates to spherical coordinates $(\\rho, \\theta, \\phi)$, we use the following formulas:\n1. $\\rho = \\sqrt{x^2 + y^2 + z^2}$\n2. $\\theta = \\arctan{\\frac{y}{x}}$\n3. $\\phi = \\arccos{\\frac{z}{\\rho}}$\n\nLet's write a function:\n\n```python\nfrom sympy import sqrt, atan2, acos, pi\n\ndef rectangular_to_spherical():\n    x, y, z = 0, -3*sqrt(3), 3\n    rho = sqrt(x**2 + y**2 + z**2)\n    theta = atan2(y, x)\n    phi = acos(z/rho)\n    return rho, theta, phi\n\nspherical_coordinates = rectangular_to_spherical()\nprint(spherical_coordinates)\n```\n```output\n(6, -pi/2, pi/3)\n```\n\nThe required form of the answer is $(\\rho, \\theta, \\phi)$, where $\\rho > 0$, $0 \\le \\theta < 2\\pi$, and $0 \\le \\phi \\le \\pi$. Since our initial output has $\\theta = -\\pi/2$, which doesn't meet the condition for $\\theta$, we add $2\\pi$ to adjust its value.\n\nHence, the spherical coordinates for the point $(0, -3\\sqrt{3}, 3)$ are $\\boxed{(6, \\frac{3\\pi}{2}, \\frac{\\pi}{3})}$.",
+        ),
+        (
+            "Compute $1011_2 + 101_2 - 1100_2 + 1101_2$.  Express your answer in base 2.",
+            'Let\'s write a single python function for binary computation:\n\n```python\ndef binary_sum_diff():\n    # Convert binary to decimal\n    num1 = int("1011", 2)\n    num2 = int("101", 2)\n    num3 = int("1100", 2)\n    num4 = int("1101", 2)\n\n    # Perform the operations\n    result = num1 + num2 - num3 + num4\n\n    # Convert the result back to binary\n    result_binary = format(result, "b")\n\n    return result_binary\n\nresult = binary_sum_diff()\nprint(result)\n```\n```output\n10001\n```\nThe answer expressed in base 2 is $\\boxed{10001_2}$.',
+        ),
+        (
+            "Find the matrix that corresponds to projecting onto the vector $\\begin{pmatrix} 2 \\\\ -3 \\end{pmatrix}.$",
+            "```python\nfrom sympy import Matrix, simplify\n\ndef projection_matrix():\n    v = Matrix([2, -3])\n\n    # Calculate the projection matrix\n    P = (v * v.T) / (v.T * v)[0]\n\n    # Simplify the elements\n    P = P.applyfunc(simplify)\n\n    return P\n\nresult = projection_matrix()\nprint(result)\n```\n```output\nMatrix([[4/13, -6/13], [-6/13, 9/13]])\n```\n\nThe matrix is $\\boxed{\\begin{pmatrix} \\frac{4}{13} & -\\frac{6}{13} \\ -\\frac{6}{13} & \\frac{9}{13} \\end{pmatrix}}.$",
+        ),
+        (
+            "Solve the inequality\n\\[\\frac{x^2 - 25}{x + 5} < 0.\\]",
+            "Let's use `sympy` to solve the inequality:\n\n```python\nfrom sympy import symbols, simplify\nfrom sympy.solvers.inequalities import solve_univariate_inequality\nfrom sympy.core.relational import StrictLessThan\n\ndef solve_inequality():\n    x = symbols('x')\n    expression = (x**2 - 25) / (x + 5)\n    inequality = StrictLessThan(expression, 0)\n    solution = solve_univariate_inequality(inequality, x, relational=False)\n    simplified_solution = simplify(solution)\n    \n    return simplified_solution\n\nresult = solve_inequality()\nprint(result)\n```\n```output\nUnion(Interval.open(-oo, -5), Interval.Lopen(-5, 5))\n```\nThe answer is $\\boxed{(-\\infty,-5)\\cup(-5,5)}$",
+        ),
+        (
+            'In the figure, triangles $ABC$ and $BCD$ are equilateral triangles. What is the value of $AD \\div BC$ when expressed in simplest radical form?\n\n[asy]\ndraw((0,0)--(5,8.7)--(10,0)--cycle);\ndraw((10,0)--(15,8.7)--(5,8.7));\nlabel("$A$",(0,0),SW);\nlabel("$B$",(5,8.7),N);\nlabel("$C$",(10,0),SE);\nlabel("$D$",(15,8.7),NE);\n[/asy]',
+            "```python\nfrom sympy import Rational, sqrt, simplify\n\ndef ad_divided_by_bc():\n\n    x = Rational(1, 1)  # Side length of equilateral triangles\n\n    ad_squared = 2 * x**2 * (1 + Rational(1, 2))  # Using the law of cosines with cos(2*pi/3) = -1/2\n    ad = sqrt(ad_squared)\n\n    bc = x # BC is the side length of the equilateral triangles\n\n    simplified_ratio = simplify(ad / bc)\n\n    return simplified_ratio\n\nresult = ad_divided_by_bc()\nprint(result)\n```\n```output\nsqrt(3)\n```\nThe value of $AD \\div BC$ is $\\boxed{\\sqrt{3}}$.",
+        ),
+    ]
+    examples["carp_en"] = [
+        (
+            "If $3 a ^ { m + 2 } b$ and $\\frac { 1 } { 2 } ab ^ { n - 1 }$ are similar terms, then $m + n$ is equal to.",
+            "Let's think step by step\n$3 a ^ { m + 2 } b$ and $\\frac { 1 } { 2 } ab ^ { n - 1 }$ are like terms. We can obtain $m + 2 = 1$ and $n - 1 = 1$. Solving for $m$ and $n$, we get $m = - 1$ and $n = 2$. Therefore, $m + n = - 1 + 2 = 1$.\nThe answer is: 1",
+        ),
+        (
+            "The solution to the equation $y - \\frac { y - 1 } { 2 } = - \\frac { y + 2 } { 5 }$ is ____ ?",
+            "Let's think step by step\nTo eliminate the denominator, we have $10 y - 5 ( y - 1 ) = - 2 ( y + 2 )$. Expanding the brackets gives $10 y - 5 y + 5 = - 2 y - 4$. Rearranging terms gives $10 y - 5 y + 2 y = - 4 - 5$, which simplifies to $7 y = - 9$. Dividing both sides by 7 gives $y = - \\frac { 9 } { 7 }$.\nThe answer is: y = - \\frac { 9 } { 7 }",
+        ),
+        (
+            "If $( m + 4 ) ^ 2 + | n - 3 | = 0$, then $\\frac { 1 } { 2 } m - n$ = ____?",
+            "Let's think step by step\n$\\because ( m + 4 ) ^ 2 + | n - 3 | = 0$, $\\therefore m + 4 = 0$, $n - 3 = 0$, which means $m = - 4$, $n = 3$. Then the original expression equals $- 2 - 3 = - 5$.\nThe answer is: - 5",
+        ),
+        (
+            "Given a quadratic equation in one variable $x$, $x ^ 2 + x + m = 0$, with one root being $x = 1$, what is the other root of this equation?",
+            "Let's think step by step\nSuppose the quadratic equation in one variable about $x$ is $x ^ 2 + x + m = 0$, and $\\alpha$ is another real root of the equation. Since one real root of the quadratic equation in one variable about $x$ is $1$, we have $\\alpha + 1 = - 1$. Therefore, $\\alpha = - 2$.\nThe answer is: - 2",
+        ),
+        (
+            "The parabola $y = - 5 { x } ^ 2 + 1$ is translated $2$ units upward and $1$ unit to the left, resulting in the parabola _____.",
+            "Let's think step by step\nThe parabola $y = - 5 { x } ^ 2 + 1$ is first shifted upward by 2 units, resulting in $y = - 5 { x } ^ 2 + 3$. Then it is shifted left by 1 unit, resulting in $y = - 5 {( x + 1 )} ^ 2 + 3$.\nThe answer is: y = - 5 ( x + 1 )  ^ { 2 } + 3",
+        ),
+        (
+            "If the radical $\\sqrt { x - 8 }$ is defined, then the range of real numbers for $x$ is ____ ?",
+            "Let's think step by step\nSince the radical $\\sqrt { x - 8 }$ is defined, therefore $x - 8 \\ge 0$, which implies $x \\ge 8$.\nThe answer is: x \\ge 8",
+        ),
+        (
+            "If $a ^ { m } \\times a ^ { 2 } = a ^ { 7 }$, then the value of $m$ is ____?",
+            "Let's think step by step\nAccording to the multiplication rule of powers with the same base: when multiplying powers with the same base, keep the base the same and add the exponents. We have $m + 2 = 7$, so solving for $m$ gives $m = 5$.\nThe answer is: 5",
+        ),
+        (
+            "If line segment $a$ and $b$ satisfy $\\frac { a } { b } = \\frac { 5 } { 2 }$, then the value of $\\frac { a - b } { b }$ is ____?",
+            "Let's think step by step\n$\\because \\frac { a } { b } = \\frac { 5 } { 2 }$, $\\therefore$ we can assume $a = 5 k$, then $b = 2 k$, $\\therefore \\frac { a - b } { b } = \\frac { 5 k - 2 k } { 2 k } = \\frac { 3 } { 2 }$.\nThe answer is: \\frac { 3 } { 2 }",
+        ),
+    ]
+
+    examples["minerva_math"] = [
+        (
+            "Find the domain of the expression $\\frac{\\sqrt{x-2}}{\\sqrt{5-x}}$.}",
+            "The expressions inside each square root must be non-negative.\nTherefore, $x-2 \\ge 0$, so $x\\ge2$, and $5 - x \\ge 0$, so $x \\le 5$.\nAlso, the denominator cannot be equal to zero, so $5-x>0$, which gives $x<5$.\nTherefore, the domain of the expression is $\\boxed{[2,5)}$.",
+        ),
+        (
+            "If $\\det \\mathbf{A} = 2$ and $\\det \\mathbf{B} = 12,$ then find $\\det (\\mathbf{A} \\mathbf{B}).$",
+            "We have that $\\det (\\mathbf{A} \\mathbf{B}) = (\\det \\mathbf{A})(\\det \\mathbf{B}) = (2)(12) = \\boxed{24}.$",
+        ),
+        (
+            "Terrell usually lifts two 20-pound weights 12 times. If he uses two 15-pound weights instead, how many times must Terrell lift them in order to lift the same total weight?",
+            "If Terrell lifts two 20-pound weights 12 times, he lifts a total of $2\\cdot 12\\cdot20=480$ pounds of weight.  If he lifts two 15-pound weights instead for $n$ times, he will lift a total of $2\\cdot15\\cdot n=30n$ pounds of weight.  Equating this to 480 pounds, we can solve for $n$: \\begin{align*}\n30n&=480\\\\\\\n\\Rightarrow\\qquad n&=480/30=\\boxed{16}\n\\end{align*}",
+        ),
+        (
+            "If the system of equations\n\n\\begin{align*}\n6x-4y&=a,\\\\\\\n6y-9x &=b.\n\\end{align*}has a solution $(x, y)$ where $x$ and $y$ are both nonzero, find $\\frac{a}{b},$ assuming $b$ is nonzero.",
+            "If we multiply the first equation by $-\\frac{3}{2}$, we obtain\n\n$$6y-9x=-\\frac{3}{2}a.$$Since we also know that $6y-9x=b$, we have\n\n$$-\\frac{3}{2}a=b\\Rightarrow\\frac{a}{b}=\\boxed{-\\frac{2}{3}}.$$",
+        ),
+    ]
+
+    examples["aqua"] = [
+        (
+            "John found that the average of 15 numbers is 40. If 10 is added to each number then the mean of the numbers is?\nAnswer Choices: (A) 50 (B) 45 (C) 65 (D) 78 (E) 64",
+            "If 10 is added to each number, then the mean of the numbers also increases by 10. So the new mean would be 50. The answer is (A).",
+        ),
+        (
+            "If a / b = 3/4 and 8a + 5b = 22,then find the value of a.\nAnswer Choices: (A) 1/2 (B) 3/2 (C) 5/2 (D) 4/2 (E) 7/2",
+            "a / b = 3/4, then b = 4a / 3. So 8a + 5(4a / 3) = 22. This simplifies to 8a + 20a / 3 = 22, which means 44a / 3 = 22. So a is equal to 3/2. The answer is (B).",
+        ),
+        (
+            "A person is traveling at 20 km/hr and reached his destiny in 2.5 hr then find the distance?\nAnswer Choices: (A) 53 km (B) 55 km (C) 52 km (D) 60 km (E) 50 km",
+            "The distance that the person traveled would have been 20 km/hr * 2.5 hrs = 50 km. The answer is (E).",
+        ),
+        (
+            "How many keystrokes are needed to type the numbers from 1 to 500?\nAnswer Choices: (A) 1156 (B) 1392 (C) 1480 (D) 1562 (E) 1788",
+            "There are 9 one-digit numbers from 1 to 9. There are 90 two-digit numbers from 10 to 99. There are 401 three-digit numbers from 100 to 500. 9 + 90(2) + 401(3) = 1392. The answer is (B).",
+        ),
+    ]
+    examples["sat_math"] = [
+        (
+            "If $\frac{x-1}{3}=k$ and $k=3$, what is the value of $x$ ? \nAnswer Choices: (A) 2 (B) 4 (C) 9 (D) 10",
+            "If k = 3, then x - 1 = 3 * 3, therfore, x - 1 = 9 and x = 10. The answer is D",
+        ),
+        (
+            "For $i=\\sqrt{-1}$, what is the sum $(7+3 i)+(-8+9 i)$ ? \nAnswer Choices: (A) $-1+12 i$ (B) $-1-6 i$ (C) $15+12 i$ (D) $15-6 i$ 3",
+            "For (7+3 i)+(-8+9 i), the real part is 7 + (-8) = -1, the imageinary part is 3 i + 9 i = 12 i. The answer is A",
+        ),
+        (
+            "On Saturday afternoon, Armand sent $m$ text messages each hour for 5 hours, and Tyrone sent $p$ text messages each hour for 4 hours. Which of the following represents the total number of messages sent by Armand and Tyrone on Saturday afternoon?\nAnswer Choices: (A) $9 m p$ (B) $20 m p$ (C) $5 m+4 p$ (D) $4 m+5 p$",
+            "Armand texts m messages each hour for 5 hours, which leads to 5m messages. Tyrone texts p messages each hour for 4 hours, which leds to 4p messages. The total is 5m + 4p. The answer is C.",
+        ),
+        (
+            "$$\begin{array}{r}3 x+4 y=-23 \\2 y-x=-19\\end{array}$$What is the solution $(x, y)$ to the system of equations above?\nAnswer Choices: (A) $(-5,-2)$ (B) $(3,-8)$ (C) $(4,-6)$ (D) $(9,-6)$",
+            "By solving this equation, we found that x = 3 and y = -8. The answer is B.",
+        ),
+    ]
+    examples["mmlu_mathematics"] = [
+        (
+            "Simplify and write the result with a rational denominator: $$\\sqrt{\\sqrt[3]{\\sqrt{\frac{1}{729}}}}$$\nAnswer Choices: (A) \\frac{3\\sqrt{3}}{3} (B) \\frac{1}{3} (C) \\sqrt{3} (D) \\frac{\\sqrt{3}}{3}",
+            "Factoring $729=3^6$ and combining the roots $\frac{1}{2}\frac{1}{3}\frac{1}{2}=\frac{1}{12}$, we get that $\\sqrt{\\sqrt[3]{\\sqrt{\frac{1}{729}}}}=\\left(\frac{1}{3^6}\right)^{\frac{1}{12}}=\frac{1}{3^{\frac{1}{2}}}=\frac{3}{\\sqrt{3}}$. The answer is (D).",
+        ),
+        (
+            "Five thousand dollars compounded annually at an $x\\%$ interest rate takes six years to double. At the same interest rate, how many years will it take $\\$300$ to grow to $\\$9600$?\nAnswer Choices:(A) 12 (B) 1 (C) 30 (D) 5",
+            "To go from $\\$300$ to $\\$9600$, the value must go up by a factor of $9600/300=32=2^5$. Since at this interest rate it takes six years for it to double, it will take $5*6=30$ years to grow to $\\$9600$. The answer is (C).",
+        ),
+        (
+            "Ten students take a biology test and receive the following scores: 45, 55, 50, 70, 65, 80, 40, 90, 70, 85. What is the mean of the students’ test scores?\nAnswer Choices: (A) 55 (B) 60 (C) 62 (D) 65",
+            "There are 10 students and the sum of their scores is $45 + 55 + 50 + 70 + 65 + 80 + 40 + 90 + 70 + 85 = 650$, the mean is $650/10=65$. The answer is (D).",
+        ),
+        (
+            "The variable $x$ varies directly as the square of $y$, and $y$ varies directly as the cube of $z$. If $x$ equals $-16$ when $z$ equals 2, what is the value of $x$ when $z$ equals $\frac{1}{2}$?\nAnswer Choices: (A) -1 (B) 16 (C) -\frac{1}{256} (D) \\frac{1}{16}",
+            "We know that $x \\propto y^2$ and $y \\propto z^3$, so $x = k z^6$ for some constant $k$. Plugging in for $x=-16$ and $z=2$, the constant value is $k=\frac{x}{z^6}=\frac{-16}{64}=-\frac{1}{4}$. So, when $z=\frac{1}{2}$, the value of $x$ is $x=kz^6=-\frac{1}{4}\frac{1}{2^6}=-\frac{1}{256}$. The answer is (C).",
+        ),
+        (
+            "Joe was in charge of lights for a dance. The red light blinks every two seconds, the yellow light every three seconds, and the blue light every five seconds. If we include the very beginning and very end of the dance, how many times during a seven minute dance will all the lights come on at the same time? (Assume that all three lights blink simultaneously at the very beginning of the dance.)\nAnswer Choices: (A) 3 (B) 15 (C) 6 (D) 5",
+            "The least common multiple of 2, 3 and 5 is 30, so during a 7 minute dance, all the three lights will come on at the same time $2*7+1=15$ times. The answer is (B).",
+        ),
+    ]
+    examples["mmlu_physics"] = [
+        (
+            "A microwave oven is connected to an outlet, 120 V, and draws a current of 2 amps. At what rate is energy being used by the microwave oven?\nAnswer Choices: (A) 10 W (B) 30 W (C) 60 W (D) 240 W",
+            "Rate of energy usage is known as power; in an dissipative electrical circuit, power is given by voltage times current. So in our case, the power is 120 V times 2 amps, or 240 W. The answer is (D).",
+        ),
+        (
+            "A point charge, Q = +1 mC, is fixed at the origin. How much work is required to move a charge, Q = +8 µC, from the point (0, 4 meters) to the point (3 meters, 0)?\nAnswer Choices: (A) 3.5 J (B) 6.0 J (C) 22.5 J (D) 40 J",
+            "To calculate the work required to move a charge from one location to another in a fixed electric field, it is enough to calculate the potential difference between the two locations. Here, the potential only depends on the distance between the charges; it’s $k q_1 q_2 / r$, where $k$ is Coulomb’s constant. Plugging in values $q_1 = $ 1 mC, $q_2 = 8 \\mu$ C, gives the answer as 5.992 J, which rounds to 6 J. The answer is (B).",
+        ),
+        (
+            "Which of the following conditions will ensure that angular momentum is conserved? I. Conservation of linear momentum II. Zero net external force III. Zero net external torque.\nAnswer Choices: (A) I and II only (B) I and III only (C) II and III only (D) III only",
+            "Torque is defined as the change in angular momentum; if there is zero external torque, angular momentum is conserved. The answer is (D).",
+        ),
+        (
+            "A photocell of work function ϕ = 2eV is connected to a resistor in series. Light of frequency f = 1 × 10^15 Hz hits a metal plate of the photocell. If the power of the light is P = 100 W, what is the current through the resistor?\nAnswer Choices: (A) 2:00 AM (B) 6:00 AM (C) 12:00 AM (D) 24 A",
+            "The only answer above which has units of current is D, 24 A. The answer is (D).",
+        ),
+        (
+            "A pipe full of air is closed at one end. A standing wave is produced in the pipe, causing the pipe to sound a note. Which of the following is a correct statement about the wave’s properties at the closed end of the pipe?\nAnswer Choices: (A) The pressure is at a node, but the particle displacement is at an antinode. (B) The pressure is at an antinode, but the particle displacement is at a node. (C) The pressure and the particle displacement are both at nodes. (D) The pressure and the particle displacement are both at antinodes.",
+            "At the closed end of the pipe, the particles cannot have any net displacement because the pipe closure stops them. So the particle displacement is at a node. This closure also causes the pressure to be maximal, i.e. an antinode. The answer is (B).",
+        ),
+    ]
+    examples["mmlu_chemistry"] = [
+        (
+            "Which of the following is considered an acid anhydride?\nAnswer Choices: (A) HCl (B) H2SO3 (C) SO2 (D) Al(NO3)3",
+            "An acid anhydride is a compound that is derived by removing water from an acid. The chemical formula for water is H2O, which means that we need to determine which of these options, when combined with H2O, forms an acid. SO2, or Sulfur dioxide, when combined with H2O, makes H2SO4, or sulfuric acid. The answer is (C).",
+        ),
+        (
+            "Which of the following is expected to be a polar molecule?\nAnswer Choices: (A) PCl4F (B) BF3 (C) CO2 (D) Si(CH3)4",
+            "A polar molecule is one that has a slightly positive charge on one end of the molecule and a slightly negative charge on the other end. Boron trifluoride (BF3) has Boron as the center atom and three fluorine atoms attached to it; it is trigonal planar and symmetric, so it is nonpolar. Carbon Dioxide (CO2) has Carbon as the central atom with double bonds to two Oxygen atoms - this is also symmetrical and therefore nonpolar. The same is the case for tetramethyl silane (SI(CH3)4), which is a Silicon atom surrounded by four methyl groups. The structure of PCL4F is that Phosphorus is the central atom, attached to four chlorines and one fluorine atom. This is asymmetrical, and therefore has a net dipole and is expected to be a polar molecule. The answer is (A).",
+        ),
+        (
+            "From the solubility rules, which of the following is true?\nAnswer Choices: (A) All chlorides, bromides, and iodides are soluble (B) All sulfates are soluble (C) All hydroxides are soluble (D) All ammonium-containing compounds are soluble",
+            "The chlorides, bromides, and iodides of lead, silver, and mercury are not soluble in water. This rules out (A). The sulfates of lead, barium, and calcium are not soluble in water, which rules out (B). The hydroxides of any metal besides sodium, potassium, ammonium, calcium, and barium are insoluble. This rules out (C). Typically ammonium ions indicate a soluble ionic substance. The answer is (D).",
+        ),
+        (
+            "A new compound is synthesized and found to be a monoprotic acid with a molar mass of 248 g/mol. When 0.0050 mol of this acid are dissolved in 0.500 L of water, the pH is measured as 3.89. What is the pKa of this acid?\nAnswer Choices: (A) 3.89 (B) 7.78 (C) 5.78 (D) 2.33",
+            "Recall that $[A] = [H^{+}]$. Here, this is equal to $$10^{-3.89}$. Then we have $K_{a} = $frac{[H^{+}][A^{-}]}{[HA]} = \\frac{10^{-3.89} \\cdot 10^{-3.89}}{10^{-2}}. The resulting exponent is $-3.89 + (-3.89) - (-2) = 5.78$, therefore $K_a = 10^{-5.78}$. The $pK_a$ is the negative log of $K_a$, which is equal to $5.78$. The answer is (C).",
+        ),
+        (
+            "A solution contains 2.00 mole of acetic acid, CH3COOH, and 1.00 mole of calcium acetate, Ca(CH3COO)2. The solution is able to resist the addition of a small amount of strong acid or strong base with only minor changes in the pH of the solution. Larger quantities of strong acid or strong base can cause a significant change in pH. How many moles of nitric acid, HNO3, may be added before the pH begins to change significantly?\nAnswer Choices: (A) 0.500 mole (B) 1.00 mole (C) 2.00 mole (D) 3.00 mole",
+            "We would like to compute the buffer capacity of this solution. First we write the equation for the ionization of the weak acid, in this case of acetic acid. $CH_{3}COOH (aq) + H_{2}O \rightarrow H_{3}O^{+} + CH3COO^{-}$. The conjugate base is therefore the acetate ion. The added strong acid, Nitric acid, will react with the conjugate base. Therefore the maximum amount of acid that can be added will be equal to the amount of acetate ion, or 2 moles. The answer is (C).",
+        ),
+    ]
+    examples["mmlu_biology"] = [
+        (
+            "In animal cells, which of the following represents the most likely pathway that a secretory protein takes as it is synthesized in a cell?\nAnswer Choices: (A) Plasma membrane–Golgi apparatus–ribosome–secretory vesicle–rough ER (B) Ribosome–Golgi apparatus–rough ER–secretory vesicle–plasma membrane (C) Plasma membrane–Golgi apparatus–ribosome–secretory vesicle–rough ER (D) Ribosome–rough ER–Golgi apparatus–secretory vesicle–plasma membrane",
+            "Protein synthesis starts at the ribosome, so we can eliminate (A) and (C). The ribosome is often in the endoplasmic reticulum and moves from there to the Golgi apparatus, where it is modified and packaged into a vesicle. The vesicle then floats to the plasma membrane and is secreted. The answer is (D).",
+        ),
+        (
+            "A mutation in a bacterial enzyme changed a previously polar amino acid into a nonpolar amino acid. This amino acid was located at a site distant from the enzyme’s active site. How might this mutation alter the enzyme’s substrate specificity?\nAnswer Choices: (A) By changing the enzyme’s pH optimum (B) By changing the enzyme’s location in the cell (C) By changing the shape of the protein (D) An amino acid change away from the active site cannot alter the enzyme’s substrate specificity.",
+            "A change in an amino acid leads to a change in the primary structure of the protein. A change in the primary structure may lead to a change in the secondary and the tertiary structure of the protein. A change in the tertiary structure means a change in the shape of the protein, so (C) has to be correct. Since the change does not affect the active site of the enzyme, we do not expect the activity of the enzyme to be affected. The answer is (C).",
+        ),
+        (
+            "Which of the following is not a way to form recombinant DNA?\nAnswer Choices: (A) Translation (B) Conjugation (C) Specialized transduction (D) Transformation",
+            "The introduction of foreign DNA or RNA into bacteria or eukaryotic cells is a common technique in molecular biology and scientific research. There are multiple ways foreign DNA can be introduced into cells including transformation, transduction, conjugation, and transfection. In contrast, (A) is not a way to form DNA: during translation the ribosomes synthesize proteins from RNA. The answer is (A).",
+        ),
+        (
+            "Homologous structures are often cited as evidence for the process of natural selection. All of the following are examples of homologous structures EXCEPT\nAnswer Choices: (A) the wings of a bird and the wings of a bat (B) the flippers of a whale and the arms of a man (C) the pectoral fins of a porpoise and the flippers of a seal (D) the forelegs of an insect and the forelimbs of a dog",
+            "Homologous structures are similar physical features in organisms that share a common ancestor ​​but different functions. Comparisons (B) and (C) are clearly homologous because they share a common ancestor and the structures serve different purposes. Bat wings and birg wings are also homologous, while they are both wings, the forelimbs serve different purposes. Insects and dogs are very far ancestors since one is vertebrate while the other is invertebrate and the forelimbs serve the same purpose, so they are not homologous. The answer is (D).",
+        ),
+        (
+            "Which of the following is not known to be involved in the control of cell division?\nAnswer Choices: (A) Cyclins (B) Protein kinases (C) Checkpoints (D) Fibroblast cells",
+            "Normal cells move through the cell cycle in a regulated way. At the checkpoint stage, they use information about their own internal state and cues from the environment around them to decide whether to proceed with cell division. Cues like these act by changing the activity of core cell cycle regulators inside the cell. The most common regulators are cyclins and cyclin-dependent kinases. Fibroblast cells do not play any role in cell division. The answer is (D).",
+        ),
+    ]
+    examples["mmlu_computer"] = [
+        (
+            "Which of the following is an example of the use of a device on the Internet of Things (IoT) ?\nAnswer Choices: (A) A car alerts a driver that it is about to hit an object. (B) A hiker uses a G P S watch to keep track of her position. (C) A refrigerator orders milk from an online delivery service when the milk in the refrigerator is almost gone. (D) A runner uses a watch with optical sensors to monitor his heart rate.",
+            "The term Internet of Things (IoT) refers to common devices which are connected to the internet, enabling new functionality. Choice A is incorrect because it does not describe an internet connected device. In choice B, the watch is only described as having GPS functionality but no internet connectivity. Choice C describes a common device (a refrigerator) which has internet connectivity enabling new functionality (online ordering). Choice D does not mention internet connectivity for the watch, only optical sensors. The answer is (C).",
+        ),
+        (
+            "Many Web browsers allow users to open anonymous windows. During a browsing session in an anonymous window, the browser does not record a browsing history or a list of downloaded files. When the anonymous window is exited, cookies created during the session are deleted. Which of the following statements about browsing sessions in an anonymous window is true?\nAnswer Choices: (A) The activities of a user browsing in an anonymous window will not be visible to people who monitor the user's network, such as the system administrator. (B) Items placed in a Web store's shopping cart for future purchase during the anonymous browsing session will not be saved on the user's computer. (C) A user will not be able to log in to e-mail or social media accounts during the anonymous browsing session. (D) A user browsing in an anonymous window will be protected from viruses launched from any web sites visited or files downloaded.",
+            "Choice A is incorrect as it only describes network traffic, which an anonymous browser does not change. Choice B is correct as it correctly describes how an anonymous browser will prevent saving data on the user’s computer after the session is ended. Choice C is incorrect because an anonymous browser will not prevent logging in to email or social media accounts. Choice D is incorrect because an anonymous browser in itself performs no virus protection. The answer is (B).",
+        ),
+        (
+            'What is the output of "abc"[::-1] in Python 3? \nAnswer Choices: (A) Error (B) abc (C) cba (D) c',
+            'We know that the slicing operator [::-1] takes all of the elements in the string in reverse order, so we reverse the order of the string "abc", resulting in "cba". The answer is (C).',
+        ),
+        (
+            'In the program below, the initial value of X is 5 and the initial value of Y is 10.\nIF (X < 0){\n DISPLAY ("Foxtrot")\n} ELSE {\n IF (X > Y){\n  DISPLAY ("Hotel")\n } ELSE {\n  IF (Y > 0){\n   DISPLAY ("November")\n  } ELSE {\n   DISPLAY ("Yankee")\n  }\n }\n}\nWhat is displayed as a result of running the program?\nAnswer Choices: (A) Foxtrot (B) Hotel (C) November (D) Yankee',
+            'Because X has the value 5, the first conditional IF (X < 0) is false, so we move to the first ELSE clause. Because X is 5 and Y is 10, the second conditional IF (X > Y) is false, so we move to the following ELSE clause. Since Y is 10, the conditional IF (Y > 0) is true, so the command DISPLAY ("November") is executed. The answer is (C).',
+        ),
+        (
+            "A list of numbers has n elements, indexed from 1 to n. The following algorithm is intended to display the number of elements in the list that have a value greater than 100. The algorithm uses the variables count and position. Steps 3 and 4 are missing.\n Step 1: Set count to 0 and position to 1.\n Step 2: If the value of the element at index position is greater than 100, increase the value of count by 1.\n Step 3: (missing step)\n Step 4: (missing step)\n Step 5: Display the value of count.\nWhich of the following could be used to replace steps 3 and 4 so that the algorithm works as intended?\nAnswer Choices: (A) Step 3: Increase the value of position by 1.\n  Step 4: Repeat steps 2 and 3 until the value of count is greater than 100.\n(B) Step 3: Increase the value of position by 1.\n  Step 4: Repeat steps 2 and 3 until the value of position is greater than n.\n(C) Step 3: Repeat step 2 until the value of count is greater than 100.\n  Step 4: Increase the value of position by 1.\n(D) Step 3: Repeat step 2 until the value of position is greater than n.\n  Step 4: Increase the value of count by 1.",
+            "Choice A is incorrect, because its Step 4 has an incorrect termination condition, stopping when count is greater than 100. We need to stop after inspecting all elements in the list. Choice B is correct because it correctly increments both count and position, and correctly repeats these steps and terminates when all elements in the list have been inspected. Choice C is incorrect because it incorrectly increments the variable count until its value is greater than 100, regardless of the elements in the list. Choice D is incorrect because its step 3 does not increment the value of position, so it will repeat forever. The answer is (B).",
+        ),
+    ]
+    # mammoth
+    examples["mmlu_stem"] = [
+        (
+            "Simplify and write the result with a rational denominator: $$\\sqrt{\\sqrt[3]{\\sqrt{\frac{1}{729}}}}$$\nAnswer Choices: (A) \\frac{3\\sqrt{3}}{3} (B) \\frac{1}{3} (C) \\sqrt{3} (D) \\frac{\\sqrt{3}}{3}",
+            "Factoring $729=3^6$ and combining the roots $\\frac{1}{2}\\frac{1}{3}\\frac{1}{2}=\\frac{1}{12}$, we get that $\\sqrt{\\sqrt[3]{\\sqrt{\frac{1}{729}}}}=\\left(\frac{1}{3^6}\right)^{\frac{1}{12}}=\frac{1}{3^{\frac{1}{2}}}=\frac{3}{\\sqrt{3}}$. The answer is (D).",
+        ),
+        (
+            "In animal cells, which of the following represents the most likely pathway that a secretory protein takes as it is synthesized in a cell?\nAnswer Choices: (A) Plasma membrane–Golgi apparatus–ribosome–secretory vesicle–rough ER (B) Ribosome–Golgi apparatus–rough ER–secretory vesicle–plasma membrane (C) Plasma membrane–Golgi apparatus–ribosome–secretory vesicle–rough ER (D) Ribosome–rough ER–Golgi apparatus–secretory vesicle–plasma membrane",
+            "Protein synthesis starts at the ribosome, so we can eliminate (A) and (C). The ribosome is often in the endoplasmic reticulum and moves from there to the Golgi apparatus, where it is modified and packaged into a vesicle. The vesicle then floats to the plasma membrane and is secreted. The answer is (D).",
+        ),
+        (
+            "A microwave oven is connected to an outlet, 120 V, and draws a current of 2 amps. At what rate is energy being used by the microwave oven?\nAnswer Choices: (A) 10 W (B) 30 W (C) 60 W (D) 240 W",
+            "Rate of energy usage is known as power; in an dissipative electrical circuit, power is given by voltage times current. So in our case, the power is 120 V times 2 amps, or 240 W. The answer is (D).",
+        ),
+        (
+            "Which of the following is considered an acid anhydride?\nAnswer Choices: (A) HCl (B) H2SO3 (C) SO2 (D) Al(NO3)3",
+            "An acid anhydride is a compound that is derived by removing water from an acid. The chemical formula for water is H2O, which means that we need to determine which of these options, when combined with H2O, forms an acid. SO2, or Sulfur dioxide, when combined with H2O, makes H2SO4, or sulfuric acid. The answer is (C).",
+        ),
+        (
+            'What is the output of "abc"[::-1] in Python 3? \nAnswer Choices: (A) Error (B) abc (C) cba (D) c',
+            'We know that the slicing operator [::-1] takes all of the elements in the string in reverse order, so we reverse the order of the string "abc", resulting in "cba". The answer is (C).',
+        ),
+    ]
+    examples["gaokao"] = [
+        (
+            "已知 $\\alpha, \\beta, \\gamma$ 是互不相同的锐角, 则在 $\\sin \\alpha \\cos \\beta, \\sin \\beta \\cos \\gamma, \\sin \\gamma \\cos \\alpha$ 三个值中, 大于 $\\frac{1}{2}$ 的个数的最大值是 ( )\n从以下选项中选择:\n(A) 0\n(B) 1\n(C) 2\n(D) 3",
+            "1. 如果 $\\alpha, \\beta, \\gamma$ 均小于 $60^\\circ$，那么他们的正弦值都小于 $\\frac{1}{2}$，因此三个值中不可能有大于 $\\frac{1}{2}$ 的值。\n2. 如果有一个角大于 $60^\\circ$，假设为 $\\alpha$，那么对应的正弦值大于 $\\frac{1}{2}$。此时，由于三角形内角和为 $180^\\circ$，所以 $\\beta + \\gamma < 120^\\circ$。这意味着 $\\beta, \\gamma$ 的余弦值均大于 $\\frac{1}{2}$，所以此时 $\\sin \\alpha \\cos \\beta > \\frac{1}{2}, \\sin \\beta \\cos \\gamma > \\frac{1}{2}$。\n3. 如果有两个角大于 $60^\\circ$，例如 $\\alpha$ 和 $\\beta$，那么由于三角形内角和为 $180^\\circ$，我们可以得到 $\\gamma < 60^\\circ$，此时 $\\sin \\gamma < \\frac{1}{2}$。由于 $\\alpha$ 和 $\\beta$ 的余弦值都小于 $\\frac{1}{2}$，因此三个值中不可能有大于 $\\frac{1}{2}$ 的值。\n4. 如果三个角都大于 $60^\\circ$，显然不符合题意。\n综上所述，当有一个角大于 $60^\\circ$ 时，大于 $\\frac{1}{2}$ 的个数的最大值是 2。\n答案是 C",
+        ),
+        (
+            "正方体 $A B C D-A_{1} B_{1} C_{1} D_{1}$ 中, $B B_{1}$ 与平面 $A C D_{1}$ 所成角的余弦值为 ( )\n从以下选项中选择:\n(A) $\\frac{\\sqrt{2}}{3}$\n(B) $\\frac{\\sqrt{3}}{3}$\n(C) $\\frac{2}{3}$\n(D) $\\frac{\\sqrt{6}}{3}$",
+            "设上下底面的中心分别为 $\\mathrm{O}_{1}, \\mathrm{O}$, 设正方体的棱长等于 1 , 则 $O_{1} O$ 与平面 $A C D_{1}$ 所成角就是 $B B_{1}$ 与平面 $A C D_{1}$ 所成角, 即 $\\angle O_{1} O D_{1}$, 直角三角形 $\\mathrm{OO}_{1} \\mathrm{D}_{1}$ 中, $\\cos \\angle \\mathrm{O}_{1} \\mathrm{OD}_{1}=\\frac{\\mathrm{O}_{1} \\mathrm{O}}{\\mathrm{OD}_{1}}=\\frac{\\frac{1}{\\sqrt{6}}}{2}=\\frac{\\sqrt{6}}{3}$. \n答案是 C",
+        ),
+        (
+            "设函数 $f(x)=\\left\\{\\begin{array}{ll}1+\\log _{2}(2-x), & x<1 \\ 2^{x-1}, & x \\geqslant 1,\\end{array}\\right.$ 则 $f(-2)+f\\left(\\log _{2} 12\\right)=$ ( )\n从以下选项中选择:\n(A) 3\n(B) 6\n(C) 9\n(D) 12",
+            "首先，我们可以根据定义计算 $f(-2)$ 和 $f(\\log_2 12)$：\n$f(-2)=1+\\log_2(2-(-2))=1+\\log_2 4=3$\n$f(\\log_2 12)=2^{\\log_2 12-1}=6$\n因此，$f(-2)+f(\\log_2 12)=3+6=9$。\n答案是 C",
+        ),
+        (
+            "已知函数 $f(x)=a x^{3}-3 x^{2}+1$, 若 $f(x)$ 存在唯一的零点 $x_{0}$, 且 $x_{0}>$ 0 , 则实数 $\\mathrm{a}$ 的取值范围是 ( )\n从以下选项中选择:\n(A) $(1,+\\infty)$\n(B) $(2,+\\infty)$\n(C) $(-\\infty,-1)$\n(D) $(-\\infty,-2)$",
+            "首先，我们可以通过求出函数的导函数 $f'(x)$ 来判断函数在 $x>0$ 区间内的单调性。在这里，我们求出导函数 $f'(x)$ 为 $f'(x)=3ax^2-6x$。\n然后，我们需要求出导函数 $f'(x)$ 的零点，以确定函数 $f(x)$ 在 $x>0$ 区间内的单调性。导函数 $f'(x)$ 的零点为 $x=0$ 和 $x=\\frac{2}{\\sqrt{a}}$。注意到 $x>0$，所以我们得到 $a<0$。此外，由于函数 $f(x)$ 在 $x=0$ 处的函数值为 $1$，因此不能有 $a=\\frac{4}{3}$。\n综上所述，当 $a$ 的取值范围为 $a<-\\frac{4}{3}$ 时，函数 $f(x)$ 在 $x>0$ 区间内是单调递减的，此时存在唯一的零点 $x_0$。因此，答案为 $(-\\infty,-2)$。\n答案是 D",
+        ),
+        (
+            "设 $\\left\\{a_{n}\\right\\}$ 是公差不为 0 的无穷等差数列, 则“ $\\left\\{a_{n}\\right\\}$ 为递增数列”是“存在正整数 $N_{0}$, 当 $n>N_{0}$ 时, $a_{n}>0$ ”的 ( )\n从以下选项中选择:\n(A) 充分而不必要条件\n(B) 必要而不充分条件\n(C) 充分必要条件\n(D) 既不充分也不必要条件",
+            "首先，我们可以通过举例来判断该条件是充分还是必要条件。如果一个数列递增，那么它的公差一定大于 0，也就是存在正整数 $N_{0}$，当 $n>N_{0}$ 时，$a_{n}>0$。因此，“ $\\left\\{a_{n}\\right\\}$ 为递增数列”是“存在正整数 $N_{0}$, 当 $n>N_{0}$ 时, $a_{n}>0$ ”的必要条件。\n接下来，我们需要判断是否充分。也就是说，如果存在正整数 $N_{0}$，当 $n>N_{0}$ 时，$a_{n}>0$，那么能否得出“ $\\left\\{a_{n}\\right\\}$ 为递增数列”这一结论。答案是肯定的。因为如果 $a_{n}>0$，那么 $a_{n+1}-a_{n}>0$，即公差大于 0，因此该数列是递增的。因此，该条件是充分条件。\n综上所述，选项为 (C) 充分必要条件。\n答案是 C",
+        ),
+    ]
+
+    return examples

grader.py

@@ -0,0 +1,395 @@
+"""
+This logic is largely copied from the Hendrycks' MATH release (math_equivalence), and borrowed from:
+- https://github.com/microsoft/ProphetNet/tree/master/CRITIC
+- https://github.com/openai/prm800k
+- https://github.com/microsoft/ToRA/blob/main/src/eval/grader.py
+- https://github.com/deepseek-ai/DeepSeek-Math/blob/main/evaluation/eval/eval_utils.py
+"""
+
+import re
+import regex
+import multiprocessing
+from math import isclose
+from typing import Union
+from collections import defaultdict
+
+from sympy import simplify, N
+from sympy.parsing.sympy_parser import parse_expr
+from sympy.parsing.latex import parse_latex
+from latex2sympy2 import latex2sympy
+
+# from .parser import choice_answer_clean, strip_string
+# from parser import choice_answer_clean
+
+
+def choice_answer_clean(pred: str):
+    pred = pred.strip("\n").rstrip(".").rstrip("/").strip(" ").lstrip(":")
+    # Clean the answer based on the dataset
+    tmp = re.findall(r"\b(A|B|C|D|E)\b", pred.upper())
+    if tmp:
+        pred = tmp
+    else:
+        pred = [pred.strip().strip(".")]
+    pred = pred[-1]
+    # Remove the period at the end, again!
+    pred = pred.rstrip(".").rstrip("/")
+    return pred
+
+
+def parse_digits(num):
+    num = regex.sub(",", "", str(num))
+    try:
+        return float(num)
+    except:
+        if num.endswith("%"):
+            num = num[:-1]
+            if num.endswith("\\"):
+                num = num[:-1]
+            try:
+                return float(num) / 100
+            except:
+                pass
+    return None
+
+
+def is_digit(num):
+    # paired with parse_digits
+    return parse_digits(num) is not None
+
+
+def str_to_pmatrix(input_str):
+    input_str = input_str.strip()
+    matrix_str = re.findall(r"\{.*,.*\}", input_str)
+    pmatrix_list = []
+
+    for m in matrix_str:
+        m = m.strip("{}")
+        pmatrix = r"\begin{pmatrix}" + m.replace(",", "\\") + r"\end{pmatrix}"
+        pmatrix_list.append(pmatrix)
+
+    return ", ".join(pmatrix_list)
+
+
+def math_equal(
+    prediction: Union[bool, float, str],
+    reference: Union[float, str],
+    include_percentage: bool = True,
+    is_close: bool = True,
+    timeout: bool = False,
+) -> bool:
+    """
+    Exact match of math if and only if:
+    1. numerical equal: both can convert to float and are equal
+    2. symbolic equal: both can convert to sympy expression and are equal
+    """
+    # print("Judge:", prediction, reference)
+    if prediction is None or reference is None:
+        return False
+    if str(prediction.strip().lower()) == str(reference.strip().lower()):
+        return True
+    if (
+        reference in ["A", "B", "C", "D", "E"]
+        and choice_answer_clean(prediction) == reference
+    ):
+        return True
+
+    try:  # 1. numerical equal
+        if is_digit(prediction) and is_digit(reference):
+            prediction = parse_digits(prediction)
+            reference = parse_digits(reference)
+            # number questions
+            if include_percentage:
+                gt_result = [reference / 100, reference, reference * 100]
+            else:
+                gt_result = [reference]
+            for item in gt_result:
+                try:
+                    if is_close:
+                        if numeric_equal(prediction, item):
+                            return True
+                    else:
+                        if item == prediction:
+                            return True
+                except Exception:
+                    continue
+            return False
+    except:
+        pass
+
+    if not prediction and prediction not in [0, False]:
+        return False
+
+    # 2. symbolic equal
+    reference = str(reference).strip()
+    prediction = str(prediction).strip()
+
+    ## pmatrix (amps)
+    if "pmatrix" in prediction and not "pmatrix" in reference:
+        reference = str_to_pmatrix(reference)
+
+    ## deal with [], (), {}
+    pred_str, ref_str = prediction, reference
+    if (
+        prediction.startswith("[")
+        and prediction.endswith("]")
+        and not reference.startswith("(")
+    ) or (
+        prediction.startswith("(")
+        and prediction.endswith(")")
+        and not reference.startswith("[")
+    ):
+        pred_str = pred_str.strip("[]()")
+        ref_str = ref_str.strip("[]()")
+    for s in ["{", "}", "(", ")"]:
+        ref_str = ref_str.replace(s, "")
+        pred_str = pred_str.replace(s, "")
+    if pred_str.lower() == ref_str.lower():
+        return True
+
+    ## [a, b] vs. [c, d], return a==c and b==d
+    if (
+        regex.match(r"(\(|\[).+(\)|\])", prediction) is not None
+        and regex.match(r"(\(|\[).+(\)|\])", reference) is not None
+    ):
+        pred_parts = prediction[1:-1].split(",")
+        ref_parts = reference[1:-1].split(",")
+        if len(pred_parts) == len(ref_parts):
+            if all(
+                [
+                    math_equal(
+                        pred_parts[i], ref_parts[i], include_percentage, is_close
+                    )
+                    for i in range(len(pred_parts))
+                ]
+            ):
+                return True
+    if (
+        (
+            prediction.startswith("\\begin{pmatrix}")
+            or prediction.startswith("\\begin{bmatrix}")
+        )
+        and (
+            prediction.endswith("\\end{pmatrix}")
+            or prediction.endswith("\\end{bmatrix}")
+        )
+        and (
+            reference.startswith("\\begin{pmatrix}")
+            or reference.startswith("\\begin{bmatrix}")
+        )
+        and (
+            reference.endswith("\\end{pmatrix}") or reference.endswith("\\end{bmatrix}")
+        )
+    ):
+        pred_lines = [
+            line.strip()
+            for line in prediction[
+                len("\\begin{pmatrix}") : -len("\\end{pmatrix}")
+            ].split("\\\\")
+            if line.strip()
+        ]
+        ref_lines = [
+            line.strip()
+            for line in reference[
+                len("\\begin{pmatrix}") : -len("\\end{pmatrix}")
+            ].split("\\\\")
+            if line.strip()
+        ]
+        matched = True
+        if len(pred_lines) == len(ref_lines):
+            for pred_line, ref_line in zip(pred_lines, ref_lines):
+                pred_parts = pred_line.split("&")
+                ref_parts = ref_line.split("&")
+                if len(pred_parts) == len(ref_parts):
+                    if not all(
+                        [
+                            math_equal(
+                                pred_parts[i],
+                                ref_parts[i],
+                                include_percentage,
+                                is_close,
+                            )
+                            for i in range(len(pred_parts))
+                        ]
+                    ):
+                        matched = False
+                        break
+                else:
+                    matched = False
+                if not matched:
+                    break
+        else:
+            matched = False
+        if matched:
+            return True
+
+    if prediction.count("=") == 1 and reference.count("=") == 1:
+        pred = prediction.split("=")
+        pred = f"{pred[0].strip()} - ({pred[1].strip()})"
+        ref = reference.split("=")
+        ref = f"{ref[0].strip()} - ({ref[1].strip()})"
+        if symbolic_equal(pred, ref) or symbolic_equal(f"-({pred})", ref):
+            return True
+    elif (
+        prediction.count("=") == 1
+        and len(prediction.split("=")[0].strip()) <= 2
+        and "=" not in reference
+    ):
+        if math_equal(
+            prediction.split("=")[1], reference, include_percentage, is_close
+        ):
+            return True
+    elif (
+        reference.count("=") == 1
+        and len(reference.split("=")[0].strip()) <= 2
+        and "=" not in prediction
+    ):
+        if math_equal(
+            prediction, reference.split("=")[1], include_percentage, is_close
+        ):
+            return True
+
+    # symbolic equal with sympy
+    if timeout:
+        if call_with_timeout(symbolic_equal_process, prediction, reference):
+            return True
+    else:
+        if symbolic_equal(prediction, reference):
+            return True
+
+    return False
+
+
+def math_equal_process(param):
+    return math_equal(param[-2], param[-1])
+
+
+def numeric_equal(prediction: float, reference: float):
+    # Note that relative tolerance has significant impact
+    # on the result of the synthesized GSM-Hard dataset
+    # if reference.is_integer():
+    #     return isclose(reference, round(prediction), abs_tol=1e-4)
+    # else:
+    # prediction = round(prediction, len(str(reference).split(".")[-1]))
+    return isclose(reference, prediction, rel_tol=1e-4)
+
+
+def symbolic_equal(a, b):
+    def _parse(s):
+        for f in [parse_latex, parse_expr, latex2sympy]:
+            try:
+                return f(s.replace("\\\\", "\\"))
+            except:
+                try:
+                    return f(s)
+                except:
+                    pass
+        return s
+
+    a = _parse(a)
+    b = _parse(b)
+
+    # direct equal
+    try:
+        if str(a) == str(b) or a == b:
+            return True
+    except:
+        pass
+
+    # simplify equal
+    try:
+        if a.equals(b) or simplify(a - b) == 0:
+            return True
+    except:
+        pass
+
+    # equation equal
+    try:
+        if (abs(a.lhs - a.rhs)).equals(abs(b.lhs - b.rhs)):
+            return True
+    except:
+        pass
+
+    try:
+        if numeric_equal(float(N(a)), float(N(b))):
+            return True
+    except:
+        pass
+
+    # matrix
+    try:
+        # if a and b are matrix
+        if a.shape == b.shape:
+            _a = a.applyfunc(lambda x: round(x, 3))
+            _b = b.applyfunc(lambda x: round(x, 3))
+            if _a.equals(_b):
+                return True
+    except:
+        pass
+
+    return False
+
+
+def symbolic_equal_process(a, b, output_queue):
+    result = symbolic_equal(a, b)
+    output_queue.put(result)
+
+
+def call_with_timeout(func, *args, timeout=1, **kwargs):
+    output_queue = multiprocessing.Queue()
+    process_args = args + (output_queue,)
+    process = multiprocessing.Process(target=func, args=process_args, kwargs=kwargs)
+    process.start()
+    process.join(timeout)
+
+    if process.is_alive():
+        process.terminate()
+        process.join()
+        return False
+
+    return output_queue.get()
+
+def _test_math_equal():
+    # print(math_equal("0.0833333333333333", "\\frac{1}{12}"))
+    # print(math_equal("(1,4.5)", "(1,\\frac{9}{2})"))
+    # print(math_equal("\\frac{x}{7}+\\frac{2}{7}", "\\frac{x+2}{7}", timeout=True))
+    # print(math_equal("\\sec^2(y)", "\\tan^2(y)+1", timeout=True))
+    # print(math_equal("\\begin{pmatrix}-\\frac{7}{4}&-2\\\\4&\\frac{1}{4}\\end{pmatrix}", "(\\begin{pmatrix}-\\frac{7}{4}&-2\\\\4&\\frac{1}{4}\\\\\\end{pmatrix})", timeout=True))
+
+    # pred = '\\begin{pmatrix}\\frac{1}{3x^{2/3}}&0&0\\\\0&1&0\\\\-\\sin(x)&0&0\\end{pmatrix}'
+    # gt = '(\\begin{pmatrix}\\frac{1}{3\\sqrt[3]{x}^2}&0&0\\\\0&1&0\\\\-\\sin(x)&0&0\\\\\\end{pmatrix})'
+
+    # pred= '-\\frac{8x^2}{9(x^2-2)^{5/3}}+\\frac{2}{3(x^2-2)^{2/3}}'
+    # gt= '-\\frac{2(x^2+6)}{9(x^2-2)\\sqrt[3]{x^2-2}^2}'
+
+    # pred =  '-34x-45y+20z-100=0'
+    # gt = '34x+45y-20z+100=0'
+
+    # pred = '\\frac{100}{3}'
+    # gt = '33.3'
+
+    # pred = '\\begin{pmatrix}0.290243531202435\\\\0.196008371385084\\\\-0.186381278538813\\end{pmatrix}'
+    # gt = '(\\begin{pmatrix}0.29\\\\0.196\\\\-0.186\\\\\\end{pmatrix})'
+
+    # pred = '\\frac{\\sqrt{\\sqrt{11}+\\sqrt{194}}}{2\\sqrt{33}+15}'
+    # gt = '\\frac{\\sqrt{\\sqrt{11}+\\sqrt{194}}}{15+2\\sqrt{33}}'
+
+    # pred = '(+5)(b+2)'
+    # gt = '(a+5)(b+2)'
+
+    # pred = '\\frac{1+\\sqrt{5}}{2}'
+    # gt = '2'
+
+    # pred = '\\frac{34}{16}+\\frac{\\sqrt{1358}}{16}', gt = '4'
+    # pred = '1', gt = '1\\\\sqrt{19}'
+
+    # pred = "(0.6,2.6667]"
+    # gt = "(\\frac{3}{5},\\frac{8}{3}]"
+
+    gt = "x+2n+1"
+    pred = "x+1"
+
+    print(math_equal(pred, gt, timeout=True))
+
+
+if __name__ == "__main__":
+    _test_math_equal()

latex2sympy/.coveragerc

@@ -0,0 +1,31 @@
+# .coveragerc to control coverage.py
+[run]
+branch = True
+include =
+    latex2sympy.py
+omit = 
+    sandbox/*
+    gen/*
+    asciimath_printer.py
+    setup.py
+    __init__.py
+
+[report]
+# Regexes for lines to exclude from consideration
+exclude_lines =
+    # Have to re-enable the standard pragma
+    pragma: no cover
+
+    # Don't complain about missing debug-only code:
+    def __repr__
+    if self\.debug
+
+    # Don't complain if tests don't hit defensive assertion code:
+    raise AssertionError
+    raise NotImplementedError
+
+    # Don't complain if non-runnable code isn't run:
+    if 0:
+    if __name__ == .__main__.:
+
+ignore_errors = True

latex2sympy/.gitignore

@@ -0,0 +1,132 @@
+# Byte-compiled / optimized / DLL files
+__pycache__/
+*.py[cod]
+*$py.class
+.antlr
+
+# C extensions
+*.so
+
+# Distribution / packaging
+.Python
+build/
+develop-eggs/
+dist/
+downloads/
+eggs/
+.eggs/
+lib/
+lib64/
+parts/
+sdist/
+var/
+wheels/
+pip-wheel-metadata/
+share/python-wheels/
+*.egg-info/
+.installed.cfg
+*.egg
+MANIFEST
+
+# PyInstaller
+#  Usually these files are written by a python script from a template
+#  before PyInstaller builds the exe, so as to inject date/other infos into it.
+*.manifest
+*.spec
+
+# Installer logs
+pip-log.txt
+pip-delete-this-directory.txt
+
+# Unit test / coverage reports
+htmlcov/
+.tox/
+.nox/
+.coverage
+.coverage.*
+.cache
+nosetests.xml
+coverage.xml
+*.cover
+.hypothesis/
+.pytest_cache/
+
+# Translations
+*.mo
+*.pot
+
+# Django stuff:
+*.log
+local_settings.py
+db.sqlite3
+
+# Flask stuff:
+instance/
+.webassets-cache
+
+# Scrapy stuff:
+.scrapy
+
+# Sphinx documentation
+docs/_build/
+
+# PyBuilder
+target/
+
+# Jupyter Notebook
+.ipynb_checkpoints
+
+# IPython
+profile_default/
+ipython_config.py
+
+# pyenv
+.python-version
+
+# pipenv
+#   According to pypa/pipenv#598, it is recommended to include Pipfile.lock in version control.
+#   However, in case of collaboration, if having platform-specific dependencies or dependencies
+#   having no cross-platform support, pipenv may install dependencies that don’t work, or not
+#   install all needed dependencies.
+#Pipfile.lock
+
+# celery beat schedule file
+celerybeat-schedule
+
+# SageMath parsed files
+*.sage.py
+
+# Environments
+.env
+.venv
+env/
+venv/
+ENV/
+env.bak/
+venv.bak/
+
+# Spyder project settings
+.spyderproject
+.spyproject
+
+# Rope project settings
+.ropeproject
+
+# mkdocs documentation
+/site
+
+# mypy
+.mypy_cache/
+.dmypy.json
+dmypy.json
+
+# Pyre type checker
+.pyre/
+
+# Azure Functions artifacts
+bin
+obj
+appsettings.json
+local.settings.json
+.python_packages
+stemgen-solution-engine.zip

latex2sympy/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright 2016, latex2sympy
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

latex2sympy/PS.g4

@@ -0,0 +1,638 @@
+grammar PS;
+
+options {
+    language=Python2;
+}
+
+WS: [ \t\r\n]+ -> skip;
+DOLLAR_SIGN: '\\$' -> skip;
+
+ADD: '+';
+SUB: '-';
+MUL: '*';
+DIV: '/' | '\\over';
+
+L_PAREN: '(';
+R_PAREN: ')';
+L_GROUP: '\\lgroup';
+R_GROUP: '\\rgroup';
+L_BRACE: '{';
+R_BRACE: '}';
+L_BRACE_VISUAL: '\\{';
+R_BRACE_VISUAL: '\\}';
+L_BRACE_CMD: '\\lbrace';
+R_BRACE_CMD: '\\rbrace';
+L_BRACKET: '[';
+R_BRACKET: ']';
+L_BRACK: '\\lbrack';
+R_BRACK: '\\rbrack';
+
+BAR: '|';
+L_VERT: '\\lvert';
+R_VERT: '\\rvert';
+VERT: '\\vert';
+
+NORM: '\\|';
+
+L_FLOOR: '\\lfloor';
+R_FLOOR: '\\rfloor';
+LL_CORNER: '\\llcorner';
+LR_CORNER: '\\lrcorner';
+
+L_CEIL: '\\lceil';
+R_CEIL: '\\rceil';
+UL_CORNER: '\\ulcorner';
+UR_CORNER: '\\urcorner';
+
+L_LEFT: '\\left';
+R_RIGHT: '\\right';
+ML_LEFT: '\\mleft';
+MR_RIGHT: '\\mright';
+
+//functions
+FUNC_LIM:  '\\lim';
+LIM_APPROACH_SYM: '\\to' | '\\rightarrow' | '\\Rightarrow' | '\\longrightarrow' | '\\Longrightarrow';
+FUNC_INT:  '\\int';
+FUNC_SUM:  '\\sum';
+FUNC_PROD: '\\prod';
+
+FUNC_LOG:  '\\log';
+FUNC_LN:   '\\ln';
+FUNC_EXP: '\\exp';
+FUNC_SIN:  '\\sin';
+FUNC_COS:  '\\cos';
+FUNC_TAN:  '\\tan';
+FUNC_CSC:  '\\csc';
+FUNC_SEC:  '\\sec';
+FUNC_COT:  '\\cot';
+
+FUNC_ARCSIN: '\\arcsin';
+FUNC_ARCCOS: '\\arccos';
+FUNC_ARCTAN: '\\arctan';
+FUNC_ARCCSC: '\\arccsc';
+FUNC_ARCSEC: '\\arcsec';
+FUNC_ARCCOT: '\\arccot';
+
+FUNC_SINH: '\\sinh';
+FUNC_COSH: '\\cosh';
+FUNC_TANH: '\\tanh';
+FUNC_ARSINH: '\\arsinh';
+FUNC_ARCOSH: '\\arcosh';
+FUNC_ARTANH: '\\artanh';
+FUNC_ARCSINH: '\\arcsinh';
+FUNC_ARCCOSH: '\\arccosh';
+FUNC_ARCTANH: '\\arctanh';
+
+FUNC_ARSINH_NAME: 'arsinh';
+FUNC_ARCSINH_NAME: 'arcsinh';
+FUNC_ARCOSH_NAME: 'arcosh';
+FUNC_ARCCOSH_NAME: 'arccosh';
+FUNC_ARTANH_NAME: 'artanh';
+FUNC_ARCTANH_NAME: 'arctanh';
+FUNC_GCD_NAME: 'gcd';
+FUNC_LCM_NAME: 'lcm';
+FUNC_FLOOR_NAME: 'floor';
+FUNC_CEIL_NAME: 'ceil';
+
+FUNC_SQRT: '\\sqrt';
+FUNC_GCD: '\\gcd';
+FUNC_LCM: '\\lcm';
+FUNC_FLOOR: '\\floor';
+FUNC_CEIL: '\\ceil';
+FUNC_MAX: '\\max';
+FUNC_MIN: '\\min';
+
+FUNC_DET: '\\det';
+
+FUNC_EYE_NAME: 'eye';
+FUNC_ZEROS_NAME: 'zeros';
+FUNC_ONES_NAME: 'ones';
+FUNC_COLS_NAME: 'cols';
+FUNC_ROWS_NAME: 'rows';
+FUNC_DIAG_NAME: 'diag';
+FUNC_NORM_NAME: 'norm';
+FUNC_RANK_NAME: 'rank';
+FUNC_TRACE_NAME: 'trace' | 'tr';
+FUNC_RREF_NAME: 'rref';
+FUNC_HSTACK_NAME: 'hstack';
+FUNC_VSTACK_NAME: 'vstack';
+FUNC_ORTHOGONALIZE_NAME: 'orth' | 'ortho' | 'orthogonal' | 'orthogonalize';
+FUNC_NULLSPACE_NAME: 'nullspace';
+FUNC_DIAGONALIZE_NAME: 'eig' | 'eigen' | 'diagonalize';
+FUNC_EIGENVALS_NAME: 'eigenvals' | 'eigenvalues';
+FUNC_EIGENVECTORS_NAME: 'eigenvects' | 'eigenvectors';
+FUNC_SVD_NAME: 'svd' | 'SVD';
+
+//commands
+CMD_TIMES: '\\times';
+CMD_CDOT:  '\\cdot';
+CMD_DIV:   '\\div';
+CMD_FRAC:  '\\frac';
+CMD_BINOM: '\\binom' | '\\tbinom' | '\\dbinom';
+CMD_CHOOSE: '\\choose';
+CMD_MOD: '\\mod';
+
+CMD_MATHIT: '\\mathit';
+
+CMD_OPERATORNAME: '\\operatorname';
+
+//matrix test
+MATRIX_TYPE_MATRIX: 'matrix';
+MATRIX_TYPE_PMATRIX: 'pmatrix';
+MATRIX_TYPE_BMATRIX: 'bmatrix';
+MATRIX_TYPE_DET: 'vmatrix';
+MATRIX_TYPES: MATRIX_TYPE_MATRIX | MATRIX_TYPE_PMATRIX | MATRIX_TYPE_BMATRIX;
+CMD_MATRIX_START: '\\begin' L_BRACE MATRIX_TYPES R_BRACE;
+CMD_MATRIX_END: '\\end' L_BRACE MATRIX_TYPES R_BRACE;
+CMD_DET_START: '\\begin' L_BRACE MATRIX_TYPE_DET R_BRACE;
+CMD_DET_END: '\\end' L_BRACE MATRIX_TYPE_DET R_BRACE;
+MATRIX_DEL_COL: '&';
+MATRIX_DEL_ROW: '\\\\';
+
+UNDERSCORE: '_';
+CARET: '^';
+COLON: ':';
+SEMICOLON: ';';
+COMMA: ',';
+PERIOD: '.';
+
+fragment WS_CHAR: [ \t\r\n];
+DIFFERENTIAL: 'd' WS_CHAR*? ([a-zA-Z] | '\\' [a-zA-Z]+);
+
+EXP_E: 'e' | '\\exponentialE';
+E_NOTATION_E: 'E';
+LETTER_NO_E: [a-df-zA-DF-Z]; // exclude e for exponential function and e notation
+fragment LETTER: [a-zA-Z];
+fragment DIGIT: [0-9];
+
+MATRIX_XRIGHTARROW: '\\xrightarrow' | '\\xRightarrow';
+TRANSFORM_EXCHANGE: '<->' | '<=>' | '\\leftrightarrow' | '\\Leftrightarrow';
+
+NUMBER:
+    DIGIT+ (COMMA DIGIT DIGIT DIGIT)*
+    | DIGIT* (COMMA DIGIT DIGIT DIGIT)* PERIOD DIGIT+;
+
+E_NOTATION: NUMBER E_NOTATION_E (SUB | ADD)? DIGIT+;
+
+IN: '\\in';
+ASSIGNMENT: '=';
+EQUAL: '==' | '\\equiv';
+LT: '<';
+LTE: '\\leq' | '\\le' | '\\leqslant';
+GT: '>';
+GTE: '\\geq' | '\\ge' | '\\geqslant';
+UNEQUAL: '!=' | '!==' | '\\ne' | '\\neq' | '\\not\\equiv';
+
+BANG: '!';
+
+fragment PERCENT_SIGN: '\\%';
+PERCENT_NUMBER: NUMBER PERCENT_SIGN;
+
+//Excludes some letters for use as e.g. constants in SYMBOL
+fragment GREEK_LETTER:
+    '\\char"000391' | //Alpha
+    '\\alpha' |
+    '\\char"000392' | //Beta
+    '\\beta' |
+    '\\Gamma' |
+    '\\gamma' |
+    '\\Delta' |
+    '\\delta' |
+    '\\char"000190' | //Epsilon
+    '\\epsilon' |
+    '\\varepsilon' |
+    '\\char"000396' | //Zeta
+    '\\zeta' |
+    '\\char"000397' | //Eta
+    '\\eta' |
+    '\\Theta' |
+    '\\theta' |
+    '\\vartheta' |
+    '\\char"000399' | //Iota
+    '\\iota' |
+    '\\char"00039A' | //Kappa
+    '\\kappa' |
+    '\\Lambda' |
+    '\\lambda' |
+    '\\char"00039C' | //Mu
+    '\\mu' |
+    '\\char"00039D' | //Nu
+    '\\nu' |
+    '\\Xi' |
+    '\\xi' |
+    '\\char"00039F' | //Omicron
+    '\\omicron' |
+    '\\Pi' |
+    '\\varpi' |
+    '\\char"0003A1' | //Rho
+    '\\rho' |
+    '\\varrho' |
+    '\\Sigma' |
+    '\\sigma' |
+    '\\varsigma' |
+    '\\char"0003A4' | //Tau
+    '\\tau' |
+    '\\Upsilon' |
+    '\\upsilon' |
+    '\\Phi' |
+    '\\phi' |
+    '\\varphi' |
+    '\\char"0003A7' | //Chi
+    '\\chi' |
+    '\\Psi' |
+    '\\psi' |
+    '\\Omega' |
+    '\\omega';
+
+GREEK_CMD: GREEK_LETTER [ ]?;
+
+fragment OTHER_SYMBOL:
+    '\\Bbbk'  |
+    '\\wp'  |
+    '\\nabla'  |
+    '\\bigstar'  |
+    '\\angle'  |
+    '\\nexists'  |
+    '\\diagdown'  |
+    '\\measuredangle'  |
+    '\\eth'  |
+    '\\emptyset'  |
+    '\\diagup'  |
+    '\\sphericalangle'  |
+    '\\clubsuit'  |
+    '\\varnothing'  |
+    '\\Diamond'  |
+    '\\complement'  |
+    '\\diamondsuit'  |
+    '\\imath'  |
+    '\\Finv'  |
+    '\\triangledown'  |
+    '\\heartsuit'  |
+    '\\jmath'  |
+    '\\Game'  |
+    '\\triangle'  |
+    '\\spadesuit'  |
+    '\\ell'  |
+    '\\hbar'  |
+    '\\vartriangle'  |
+    '\\hslash'  |
+    '\\blacklozenge'  |
+    '\\lozenge'  |
+    '\\blacksquare'  |
+    '\\mho'  |
+    '\\blacktriangle'  |
+    '\\sharp'  |
+    '\\prime'  |
+    '\\Im'  |
+    '\\flat'  |
+    '\\square'  |
+    '\\backprime'  |
+    '\\Re'  |
+    '\\natural'  |
+    '\\surd'  |
+    '\\circledS';
+OTHER_SYMBOL_CMD: OTHER_SYMBOL [ ]?;
+
+fragment PI: '\\pi';
+fragment INFTY_CMD: '\\infty';
+fragment PARTIAL_CMD: '\\partial';
+fragment INFTY: INFTY_CMD | DOLLAR_SIGN INFTY_CMD | INFTY_CMD PERCENT_SIGN;
+fragment EMPTYSET: '\\emptyset';
+SYMBOL: PI | PARTIAL_CMD | INFTY | EMPTYSET;
+
+fragment VARIABLE_CMD: '\\variable';
+fragment VARIABLE_SYMBOL: (GREEK_CMD | OTHER_SYMBOL_CMD | LETTER | DIGIT)+ (UNDERSCORE ((L_BRACE (GREEK_CMD | OTHER_SYMBOL_CMD | LETTER | DIGIT | COMMA)+ R_BRACE) | (GREEK_CMD | OTHER_SYMBOL_CMD | LETTER | DIGIT)))?;
+VARIABLE: VARIABLE_CMD L_BRACE VARIABLE_SYMBOL R_BRACE PERCENT_SIGN?;
+
+//collection of accents
+accent_symbol:
+    '\\acute'  |
+    '\\bar'  |
+    '\\overline'  |
+    '\\breve'  |
+    '\\check'  |
+    '\\widecheck'  |
+    '\\dot'  |
+    '\\ddot'  |
+    '\\grave'  |
+    '\\hat'  |
+    '\\tilde'  |
+    '\\widetilde'  |
+    '\\vec'  |
+    '\\overrightarrow'  |
+    '\\bm'  |
+    '\\boldsymbol'  |
+    '\\text'  |
+    '\\textit'  |
+    '\\mathbb'  |
+    '\\mathbin'  |
+    '\\mathbf'  |
+    '\\mathcal'  |
+    '\\mathclap'  |
+    '\\mathclose'  |
+    '\\mathellipsis'  |
+    '\\mathfrak'  |
+    '\\mathinner'  |
+    '\\mathit'  |
+    '\\mathnormal'  |
+    '\\mathop'  |
+    '\\mathopen'  |
+    '\\mathord'  |
+    '\\mathpunct'  |
+    '\\mathrel'  |
+    '\\mathring'  |
+    '\\mathrlap'  |
+    '\\mathrm'  |
+    '\\mathscr'  |
+    '\\mathsf'  |
+    '\\mathsterling'  |
+    '\\mathtt';
+
+math: relation | relation_list;
+
+transpose: '^T' | '^{T}' |  '^{\\top}' | '\'';
+
+transform_atom: LETTER_NO_E UNDERSCORE (NUMBER | L_BRACE NUMBER R_BRACE);
+transform_scale: (expr | group | ADD | SUB) transform_atom;
+transform_swap: transform_atom TRANSFORM_EXCHANGE transform_atom;
+transform_assignment: transform_atom transform_scale;
+elementary_transform: transform_assignment | transform_scale | transform_swap;
+elementary_transforms: elementary_transform (COMMA elementary_transform)*;
+
+matrix:
+    CMD_MATRIX_START
+    matrix_row (MATRIX_DEL_ROW matrix_row)* MATRIX_DEL_ROW?
+    CMD_MATRIX_END
+    (MATRIX_XRIGHTARROW (L_BRACKET elementary_transforms R_BRACKET)? L_BRACE elementary_transforms R_BRACE)?;
+
+det:
+    CMD_DET_START
+    matrix_row (MATRIX_DEL_ROW matrix_row)* MATRIX_DEL_ROW?
+    CMD_DET_END;
+
+matrix_row:
+    expr (MATRIX_DEL_COL expr)*;
+
+relation:
+    relation (IN | ASSIGNMENT | EQUAL | LT | LTE | GT | GTE | UNEQUAL) relation
+    | expr;
+
+relation_list:
+    relation_list_content
+    | L_BRACKET relation_list_content R_BRACKET
+    | L_BRACE relation_list_content R_BRACE
+    | L_BRACE_VISUAL relation_list_content R_BRACE_VISUAL
+    | L_LEFT L_BRACKET relation_list_content R_RIGHT R_BRACKET
+    | L_LEFT L_BRACE_VISUAL relation_list_content R_RIGHT R_BRACE_VISUAL
+    | ML_LEFT L_BRACKET relation_list_content MR_RIGHT R_BRACKET
+    | ML_LEFT L_BRACE_VISUAL relation_list_content MR_RIGHT R_BRACE_VISUAL;
+
+relation_list_content:
+    relation COMMA relation (COMMA relation)*
+    | relation SEMICOLON relation (SEMICOLON relation)*;
+
+equality:
+    expr (EQUAL | ASSIGNMENT) expr;
+
+expr: additive;
+
+additive:
+    additive (ADD | SUB) additive
+    | mp;
+
+// mult part
+mp:
+    mp (MUL | CMD_TIMES | CMD_CDOT | DIV | CMD_DIV | COLON | CMD_MOD) mp
+    | unary;
+
+mp_nofunc:
+    mp_nofunc (MUL | CMD_TIMES | CMD_CDOT | DIV | CMD_DIV | COLON | CMD_MOD) mp_nofunc
+    | unary_nofunc;
+
+unary:
+    (ADD | SUB) unary
+    | postfix+;
+
+unary_nofunc:
+    (ADD | SUB) unary_nofunc
+    | postfix postfix_nofunc*;
+
+postfix: exp postfix_op*;
+postfix_nofunc: exp_nofunc postfix_op*;
+postfix_op: BANG | eval_at | transpose;
+
+eval_at:
+    BAR (eval_at_sup | eval_at_sub | eval_at_sup eval_at_sub);
+
+eval_at_sub:
+    UNDERSCORE L_BRACE
+    (expr | equality)
+    R_BRACE;
+
+eval_at_sup:
+    CARET L_BRACE
+    (expr | equality)
+    R_BRACE;
+
+exp:
+    exp CARET (atom | L_BRACE expr R_BRACE) subexpr?
+    | comp;
+
+exp_nofunc:
+    exp_nofunc CARET (atom | L_BRACE expr R_BRACE) subexpr?
+    | comp_nofunc;
+
+comp:
+    group
+    | norm_group
+    | abs_group
+    | floor_group
+    | ceil_group
+    | func
+    | atom
+    | frac
+    | binom
+    | matrix
+    | det;
+
+comp_nofunc:
+    group
+    | norm_group
+    | abs_group
+    | floor_group
+    | ceil_group
+    | atom
+    | frac
+    | binom
+    | matrix
+    | det;
+
+group:
+    L_PAREN expr R_PAREN
+    | L_GROUP expr R_GROUP
+    | L_BRACE expr R_BRACE
+    | L_BRACE_VISUAL expr R_BRACE_VISUAL
+    | L_BRACE_CMD expr R_BRACE_CMD
+    | L_BRACKET expr R_BRACKET
+    | L_BRACK expr R_BRACK
+    | L_LEFT L_PAREN expr R_RIGHT R_PAREN
+    | L_LEFT L_GROUP expr R_RIGHT R_GROUP
+    | L_LEFT L_BRACE expr R_RIGHT R_BRACE
+    | L_LEFT L_BRACE_VISUAL expr R_RIGHT R_BRACE_VISUAL
+    | L_LEFT L_BRACE_CMD expr R_RIGHT R_BRACE_CMD
+    | L_LEFT L_BRACKET expr R_RIGHT R_BRACKET
+    | L_LEFT L_BRACK expr R_RIGHT R_BRACK
+    | ML_LEFT L_PAREN expr MR_RIGHT R_PAREN
+    | ML_LEFT L_GROUP expr MR_RIGHT R_GROUP
+    | ML_LEFT L_BRACE expr MR_RIGHT R_BRACE
+    | ML_LEFT L_BRACE_VISUAL expr MR_RIGHT R_BRACE_VISUAL
+    | ML_LEFT L_BRACE_CMD expr MR_RIGHT R_BRACE_CMD
+    | ML_LEFT L_BRACKET expr MR_RIGHT R_BRACKET
+    | ML_LEFT L_BRACK expr MR_RIGHT R_BRACK;
+
+
+norm_group:
+    NORM expr NORM
+    | L_LEFT NORM expr R_RIGHT NORM
+    | ML_LEFT NORM expr MR_RIGHT NORM;
+
+
+abs_group:
+    BAR expr BAR
+    | L_VERT expr R_VERT
+    | VERT expr VERT
+    | L_LEFT BAR expr R_RIGHT BAR
+    | L_LEFT L_VERT expr R_RIGHT R_VERT
+    | L_LEFT VERT expr R_RIGHT VERT
+    | ML_LEFT BAR expr MR_RIGHT BAR
+    | ML_LEFT L_VERT expr MR_RIGHT R_VERT
+    | ML_LEFT VERT expr MR_RIGHT VERT;
+
+
+floor_group:
+    L_FLOOR expr R_FLOOR
+    | LL_CORNER expr LR_CORNER
+    | L_LEFT L_FLOOR expr R_RIGHT R_FLOOR
+    | L_LEFT LL_CORNER expr R_RIGHT LR_CORNER
+    | ML_LEFT L_FLOOR expr MR_RIGHT R_FLOOR
+    | ML_LEFT LL_CORNER expr MR_RIGHT LR_CORNER;
+
+
+ceil_group:
+    L_CEIL expr R_CEIL
+    | UL_CORNER expr UR_CORNER
+    | L_LEFT L_CEIL expr R_RIGHT R_CEIL
+    | L_LEFT UL_CORNER expr R_RIGHT UR_CORNER
+    | ML_LEFT L_CEIL expr MR_RIGHT R_CEIL
+    | ML_LEFT UL_CORNER expr MR_RIGHT UR_CORNER;
+
+
+//indicate an accent
+accent:
+    accent_symbol
+    L_BRACE base=expr R_BRACE;
+
+atom_expr_no_supexpr: (LETTER_NO_E | GREEK_CMD | OTHER_SYMBOL_CMD | accent) subexpr?;
+atom_expr: (LETTER_NO_E | GREEK_CMD | OTHER_SYMBOL_CMD | accent) (supexpr subexpr | subexpr supexpr | subexpr | supexpr)?;
+atom: atom_expr | SYMBOL | NUMBER | PERCENT_NUMBER | E_NOTATION | DIFFERENTIAL | mathit | VARIABLE;
+
+mathit: CMD_MATHIT L_BRACE mathit_text R_BRACE;
+mathit_text: (LETTER_NO_E | E_NOTATION_E | EXP_E)+;
+
+frac:
+    CMD_FRAC L_BRACE
+    upper=expr
+    R_BRACE L_BRACE
+    lower=expr
+    R_BRACE;
+
+//a binomial expression
+binom:
+    L_BRACE upper=expr CMD_CHOOSE lower=expr R_BRACE
+    | CMD_BINOM L_BRACE upper=expr R_BRACE L_BRACE lower=expr R_BRACE;
+
+func_normal_functions_single_arg:
+    FUNC_LOG | FUNC_LN | FUNC_EXP
+    | FUNC_SIN | FUNC_COS | FUNC_TAN
+    | FUNC_CSC | FUNC_SEC | FUNC_COT
+    | FUNC_ARCSIN | FUNC_ARCCOS | FUNC_ARCTAN
+    | FUNC_ARCCSC | FUNC_ARCSEC | FUNC_ARCCOT
+    | FUNC_SINH | FUNC_COSH | FUNC_TANH
+    | FUNC_ARSINH | FUNC_ARCOSH | FUNC_ARTANH
+    | FUNC_ARCSINH | FUNC_ARCCOSH | FUNC_ARCTANH
+    | FUNC_FLOOR | FUNC_CEIL | FUNC_DET;
+
+func_normal_functions_multi_arg:
+    FUNC_GCD | FUNC_LCM | FUNC_MAX | FUNC_MIN;
+
+func_operator_names_single_arg:
+    FUNC_ARSINH_NAME | FUNC_ARCOSH_NAME | FUNC_ARTANH_NAME
+    | FUNC_ARCSINH_NAME | FUNC_ARCCOSH_NAME | FUNC_ARCTANH_NAME
+    | FUNC_FLOOR_NAME | FUNC_CEIL_NAME | FUNC_EYE_NAME | FUNC_RANK_NAME | FUNC_TRACE_NAME
+    | FUNC_RREF_NAME | FUNC_NULLSPACE_NAME | FUNC_DIAGONALIZE_NAME | FUNC_NORM_NAME
+    | FUNC_EIGENVALS_NAME | FUNC_EIGENVECTORS_NAME | FUNC_SVD_NAME | FUNC_COLS_NAME | FUNC_ROWS_NAME;
+
+func_operator_names_multi_arg:
+    FUNC_GCD_NAME | FUNC_LCM_NAME | FUNC_ZEROS_NAME | FUNC_ORTHOGONALIZE_NAME
+    | FUNC_ONES_NAME | FUNC_DIAG_NAME | FUNC_HSTACK_NAME | FUNC_VSTACK_NAME;
+
+func_normal_single_arg:
+    (func_normal_functions_single_arg)
+    |
+    (CMD_OPERATORNAME L_BRACE func_operator_name=func_operator_names_single_arg R_BRACE);
+
+func_normal_multi_arg:
+    (func_normal_functions_multi_arg)
+    |
+    (CMD_OPERATORNAME L_BRACE func_operator_name=func_operator_names_multi_arg R_BRACE);
+
+func:
+    func_normal_single_arg
+    (subexpr? supexpr? | supexpr? subexpr?)
+    (L_LEFT? L_PAREN func_single_arg R_RIGHT? R_PAREN | ML_LEFT? L_PAREN func_single_arg MR_RIGHT? R_PAREN | func_single_arg_noparens)
+    
+    | func_normal_multi_arg
+    (subexpr? supexpr? | supexpr? subexpr?)
+    (L_LEFT? L_PAREN func_multi_arg R_RIGHT? R_PAREN | ML_LEFT? L_PAREN func_multi_arg MR_RIGHT? R_PAREN | func_multi_arg_noparens)
+
+    | atom_expr_no_supexpr supexpr?
+    L_LEFT? (L_PAREN | L_BRACKET) func_common_args (R_PAREN | R_BRACKET) R_RIGHT?
+    | atom_expr_no_supexpr supexpr?
+    L_BRACE L_LEFT? (L_PAREN | L_BRACKET) func_common_args (R_PAREN | R_BRACKET) R_RIGHT? R_BRACE
+
+    | FUNC_INT
+    (subexpr supexpr | supexpr subexpr | (UNDERSCORE L_BRACE R_BRACE) (CARET L_BRACE R_BRACE) | (CARET L_BRACE R_BRACE) (UNDERSCORE L_BRACE R_BRACE) )?
+    (additive? DIFFERENTIAL | frac | additive)
+
+    | FUNC_SQRT
+    (L_BRACKET root=expr R_BRACKET)?
+    L_BRACE base=expr R_BRACE
+
+    | (FUNC_SUM | FUNC_PROD)
+    (subeq supexpr | supexpr subeq)
+    mp
+    | FUNC_LIM limit_sub mp
+    | EXP_E supexpr?; //Exponential function e^x
+
+args: (expr ',' args) | expr;
+
+func_common_args: atom | (expr ',') | (expr ',' args);
+
+limit_sub:
+    UNDERSCORE L_BRACE
+    (LETTER_NO_E | GREEK_CMD | OTHER_SYMBOL_CMD)
+    LIM_APPROACH_SYM
+    expr (CARET L_BRACE (ADD | SUB) R_BRACE)?
+    R_BRACE;
+
+func_single_arg: expr;
+func_single_arg_noparens: mp_nofunc;
+
+func_multi_arg: expr | (expr ',' func_multi_arg);
+func_multi_arg_noparens: mp_nofunc;
+
+subexpr: UNDERSCORE (atom | L_BRACE (expr | args) R_BRACE);
+supexpr: CARET (atom | L_BRACE expr R_BRACE);
+
+subeq: UNDERSCORE L_BRACE equality R_BRACE;
+supeq: UNDERSCORE L_BRACE equality R_BRACE;

latex2sympy/README.md

@@ -0,0 +1,196 @@
+![Logo](https://picgo-1258602555.cos.ap-nanjing.myqcloud.com/icon.png)
+
+# [latex2sympy2](https://github.com/OrangeX4/latex2sympy)
+
+## About
+
+`latex2sympy2` parses **LaTeX math expressions** and converts it into the equivalent **SymPy form**. The latex2sympy2 is adapted from [augustt198/latex2sympy](https://github.com/augustt198/latex2sympy) and [purdue-tlt / latex2sympy](https://github.com/purdue-tlt/latex2sympy).
+
+This project is a part of a VS Code extension called [Latex Sympy Calculator](https://marketplace.visualstudio.com/items?itemName=OrangeX4.latex-sympy-calculator). It is designed for providing people writing in latex or markdown a ability to calculate something when writing math expression.
+
+[ANTLR](http://www.antlr.org/) is used to generate the parser.
+
+## Features
+
+* **Arithmetic:** Add (+), Sub (-), Dot Mul (·), Cross Mul (×), Frac (/), Power (^), Abs (|x|), Sqrt (√), etc...
+* **Alphabet:** a - z, A - Z, α - ω, Subscript (x_1), Accent Bar(ā), etc...
+* **Common Functions:** gcd, lcm, floor, ceil, max, min, log, ln, exp, sin, cos, tan, csc, sec, cot, arcsin, sinh, arsinh, etc...
+* **Funcion Symbol:** f(x), f(x-1,), g(x,y), etc...
+* **Calculous:** Limit ($lim_{n\to\infty}$), Derivation ($\frac{d}{dx}(x^2+x)$), Integration ($\int xdx$), etc...
+* **Linear Algebra:** Matrix, Determinant, Transpose, Inverse, Elementary Transformation, etc...
+* **Other:** Binomial...
+
+**NOTICE:** It will do some irreversible calculations when converting determinants, transposed matrixes and elementary transformations...
+
+## Installation
+
+```
+pip install latex2sympy2
+```
+
+**Requirements:** `sympy` and `antlr4-python3-runtime` packages.
+
+## Usage
+
+### Basic
+
+In Python:
+
+```python
+from latex2sympy2 import latex2sympy, latex2latex
+
+tex = r"\frac{d}{dx}(x^{2}+x)"
+# Or you can use '\mathrm{d}' to replace 'd'
+latex2sympy(tex)
+# => "Derivative(x**2 + x, x)"
+latex2latex(tex)
+# => "2 x + 1"
+```
+
+### Examples
+
+|LaTeX|Converted SymPy|Calculated Latex|
+|-----|-----|---------------|
+|`x^{3}` $x^{3}$| `x**3`|`x^{3}` $x^{3}$|
+|`\frac{d}{dx} tx` $\frac{d}{dx}tx$|`Derivative(x*t, x)`|`t` $t$|
+|`\sum_{i = 1}^{n} i` $\sum_{i = 1}^{n} i$|`Sum(i, (i, 1, n))`|`\frac{n \left(n + 1\right)}{2}` $\frac{n \left(n + 1\right)}{2}$|
+|`\int_{a}^{b} \frac{dt}{t}`|`Integral(1/t, (t, a, b))`|`-\log{(a)} + \log{(b)}` $-\log{(a)} + \log{(b)}$|
+|`(2x^3 - x + z)|_{x=3}` $(2x^3 - x + z)\|_{x=3}$|`z + 51`| `z + 51` $z + 51$ |
+
+If you want to read the math formula, you can click [GitNotes](https://notes.orangex4.cool/?git=github&github=OrangeX4/latex2sympy).
+
+### Solve Equation
+
+``` latex
+# Before
+x + y = 1
+
+# After
+[ y = 1 - x, \  x = 1 - y]
+```
+
+### Eval At
+
+``` latex
+# Before
+(x+2)|_{x=y+1}
+
+# After
+y + 3
+```
+
+### Matrix
+
+#### Identity matrix
+
+```
+tex = r"\bm{I}_3"
+latex2sympy(tex)
+# => "Matrix([[1, 0, 0], [0, 1, 0], [0, 0, 1]])"
+```
+
+#### Determinant
+
+``` python
+from latex2sympy2 import latex2sympy
+
+tex = r"\begin{vmatrix} x & 0 & 0 \\ 0 & x & 0 \\ 0 & 0 & x \end{vmatrix}"
+latex2sympy(tex)
+# => "x^{3}"
+```
+
+#### Transpose
+
+``` python
+from latex2sympy2 import latex2sympy
+
+tex = r"\begin{pmatrix} 1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 9 \end{pmatrix}^T"
+# Or you can use "\begin{pmatrix}1&2&3\\4&5&6\\7&8&9\end{pmatrix}'"
+latex2sympy(tex)
+# => "Matrix([[1, 4, 7], [2, 5, 8], [3, 6, 9]])"
+```
+
+#### Elementary Transformation
+
+``` python
+from latex2sympy2 import latex2sympy
+
+matrix = r'''
+    \begin{pmatrix}
+        1 & 2 & 3 \\ 
+        4 & 5 & 6 \\
+        7 & 8 & 9 \\ 
+    \end{pmatrix}
+'''
+
+# Scale the row with grammar "\xrightarrow{kr_n}"
+tex = matrix + r'\xrightarrow{3r_1}'
+latex2sympy(tex)
+# => "Matrix([[3, 6, 9], [4, 5, 6], [7, 8, 9]])"
+
+# Swap the cols with grammar "\xrightarrow{c_1<=>c_2}"
+# Of course, you can use "\leftrightarrow" to replace "<=>" 
+tex = matrix + r'\xrightarrow{c_1<=>c_2}'
+latex2sympy(tex)
+# => "Matrix([[2, 1, 3], [5, 4, 6], [8, 7, 9]])"
+
+# Scale the second row and add it to the first row
+# with grammar "\xrightarrow{r_1+kr_2}"
+tex = matrix + r'\xrightarrow{r_1+kr_2}'
+latex2sympy(tex)
+# => "Matrix([[4*k + 1, 5*k + 2, 6*k + 3], [4, 5, 6], [7, 8, 9]])"
+
+# You can compose the transform with comma ","
+# and grammar "\xrightarrow[4r_3]{2r_1, 3r_2}"
+# Remember the priority of "{}" is higher than "[]"
+tex = matrix + r'\xrightarrow[4r_3]{2r_1, 3r_2}'
+latex2sympy(tex)
+# => "Matrix([[2, 4, 6], [12, 15, 18], [28, 32, 36]])"
+```
+
+### Variances
+
+``` python
+from latex2sympy2 import latex2sympy, variances, var, set_variances
+
+# Assign x a value of 1
+latex2sympy(r"x = 1")
+
+# Assign x a matrix symbol with dimension of n x m
+latex2sympy(r"x \in \mathbb{R}^{n \times m}")
+
+# Calculate x + y
+latex2sympy(r"x + y")
+# => "y + 1"
+
+# Get all variances
+print(variances)
+# => "{x: 1}"
+
+# Get variance of "x"
+print(var["x"])
+# => "1"
+
+# Reset all variances
+set_variances({})
+latex2sympy(r"x + y")
+# => "x + y"
+```
+
+### Complex Number Support
+
+``` python
+from latex2sympy2 import set_real
+
+set_real(False)
+```
+
+
+## Contributing
+
+If you want to add a new grammar, you can fork the code from [OrangeX4/latex2sympy](https://github.com/OrangeX4/latex2sympy).
+
+* To modify parser grammar, view the existing structure in `PS.g4`.
+* To modify the action associated with each grammar, look into `latex2sympy.py`.
+
+Contributors are welcome! Feel free to open a pull request or an issue.

latex2sympy/__init__.py

@@ -0,0 +1 @@
+import latex2sympy

latex2sympy/antlr-4.11.1-complete.jar

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:62975e192b4af2622b72b5f0131553ee3cbce97f76dc2a41632dcc55e25473e1
+size 3547867

latex2sympy/asciimath_printer.py

@@ -0,0 +1,50 @@
+from sympy.printing.str import StrPrinter
+from sympy.core import S
+
+class AsciiMathPrinter(StrPrinter):
+
+    def _print_Limit(self, expr):
+        e, z = expr.args
+
+        return "lim_(%s -> %s) %s" % (self._print(z), self._print(z), self._print(e))
+
+    def _print_Integral(self, expr):
+        e, lims = expr.args
+        if len(lims) > 1:
+            return "int_(%s)^(%s) %s d%s" % (self._print(lims[1]), self._print(lims[2]), self._print(e), self._print(lims[0]))
+        else:
+            return "int %s d%s" % (self._print(e), self._print(lims))
+    
+    def _print_Sum(self, expr):
+        e, lims = expr.args
+        return "sum_(%s = %s)^(%s) %s" % (self._print(lims[0]), self._print(lims[1]), self._print(lims[2]), self._print(e))
+
+    def _print_Product(self, expr):
+        e, lims = expr.args
+        return "prod_(%s = %s)^(%s) %s" % (self._print(lims[0]), self._print(lims[1]), self._print(lims[2]), self._print(e))
+
+    def _print_factorial(self, expr):
+        return "%s!" % self._print(expr.args[0])
+
+    def _print_Derivative(self, expr):
+        e = expr.args[0]
+        wrt = expr.args[1]
+        return "d/d%s %s" % (self._print(wrt), self._print(e))
+
+    def _print_Abs(self, expr):
+        return "|%s|" % self._print(expr.args[0])
+
+    def _print_Equality(self, expr):
+        return "%s = %s" % (self._print(expr.args[0]), self._print(expr.args[1]))
+
+    def _print_Pow(self, expr):
+        b = self._print(expr.base)
+        if expr.exp is S.Half:
+            return "sqrt(%s)" % b
+
+        if -expr.exp is S.Half:
+            return "1/sqrt(%s)" % b
+        if expr.exp is -S.One:
+            return "1/%s" % b
+
+        return "%s^(%s)" % (b, self._print(expr.exp)) 

latex2sympy/description.txt

@@ -0,0 +1,152 @@
+latex2sympy2: https://github.com/OrangeX4/latex2sympy
+
+About
+
+`latex2sympy2` parses **LaTeX math expressions** and converts it into the equivalent **SymPy form**. The latex2sympy2 is adapted from [augustt198/latex2sympy](https://github.com/augustt198/latex2sympy) and [purdue-tlt / latex2sympy](https://github.com/purdue-tlt/latex2sympy).
+
+[ANTLR](http://www.antlr.org/) is used to generate the parser.
+
+Features
+
+* **Arithmetic:** Add (+), Sub (-), Dot Mul (·), Cross Mul (×), Frac (/), Power (^), Abs (|x|), Sqrt (√), etc...
+* **Alphabet:** a - z, A - Z, α - ω, Subscript (x_1), Accent Bar(ā), etc...
+* **Common Functions:** gcd, lcm, floor, ceil, max, min, log, ln, exp, sin, cos, tan, csc, sec, cot, arcsin, sinh, arsinh, etc...
+* **Calculous:** Limit ($lim_{n\to\infty}$), Derivation ($\frac{d}{dx}(x^2+x)$), Integration ($\int xdx$), etc...
+* **Linear Algebra:** Matrix, Determinant, Transpose, Inverse, Elementary Transformation, etc...
+* **Other:** Binomial...
+
+**NOTICE:** It will do some irreversible calculations when converting determinants, transposed matrixes and elementary transformations...
+
+Installation
+
+```
+pip install latex2sympy2
+```
+
+**Requirements:** `sympy` and `antlr4-python3-runtime` packages.
+
+Usage
+
+ Basic
+
+In Python:
+
+```python
+from latex2sympy2 import latex2sympy, latex2latex
+
+tex = r"\frac{d}{dx}(x^{2}+x)"
+# Or you can use '\mathrm{d}' to replace 'd'
+latex2sympy(tex)
+# => "Derivative(x**2 + x, x)"
+latex2latex(tex)
+# => "2 x + 1"
+```
+
+ Examples
+
+|LaTeX|Converted SymPy|Calculated Latex|
+|-----|-----|---------------|
+|`x^{3}` $x^{3}$| `x**3`|`x^{3}` $x^{3}$|
+|`\frac{d}{dx} tx` $\frac{d}{dx}tx$|`Derivative(x*t, x)`|`t` $t$|
+|`\sum_{i = 1}^{n} i` $\sum_{i = 1}^{n} i$|`Sum(i, (i, 1, n))`|`\frac{n \left(n + 1\right)}{2}` $\frac{n \left(n + 1\right)}{2}$|
+|`\int_{a}^{b} \frac{dt}{t}`|`Integral(1/t, (t, a, b))`|`-\log{(a)} + \log{(b)}` $-\log{(a)} + \log{(b)}$|
+|`(2x^3 - x + z)|_{x=3}` $(2x^3 - x + z)\|_{x=3}$|`z + 51`| `z + 51` $z + 51$ |
+
+If you want to read the math formula, you can click [GitNotes](https://notes.orangex4.cool/?git=github&github=OrangeX4/latex2sympy).
+
+ Matrix
+
+Determinant
+
+``` python
+from latex2sympy2 import latex2sympy
+
+tex = r"\begin{vmatrix} x & 0 & 0 \\ 0 & x & 0 \\ 0 & 0 & x \end{vmatrix}"
+latex2sympy(tex)
+# => "x^{3}"
+```
+
+Transpose
+
+``` python
+from latex2sympy2 import latex2sympy
+
+tex = r"\begin{pmatrix} 1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 9 \end{pmatrix}^T"
+# Or you can use "\begin{pmatrix}1&2&3\\4&5&6\\7&8&9\end{pmatrix}'"
+latex2sympy(tex)
+# => "Matrix([[1, 4, 7], [2, 5, 8], [3, 6, 9]])"
+```
+
+Elementary Transformation
+
+``` python
+from latex2sympy2 import latex2sympy
+
+matrix = r'''
+    \begin{pmatrix}
+        1 & 2 & 3 \\ 
+        4 & 5 & 6 \\
+        7 & 8 & 9 \\ 
+    \end{pmatrix}
+'''
+
+# Scale the row with grammar "\xrightarrow{kr_n}"
+tex = matrix + r'\xrightarrow{3r_1}'
+latex2sympy(tex)
+# => "Matrix([[3, 6, 9], [4, 5, 6], [7, 8, 9]])"
+
+# Swap the cols with grammar "\xrightarrow{c_1<=>c_2}"
+# Of course, you can use "\leftrightarrow" to replace "<=>" 
+tex = matrix + r'\xrightarrow{c_1<=>c_2}'
+latex2sympy(tex)
+# => "Matrix([[2, 1, 3], [5, 4, 6], [8, 7, 9]])"
+
+# Scale the second row and add it to the first row
+# with grammar "\xrightarrow{r_1+kr_2}"
+tex = matrix + r'\xrightarrow{r_1+kr_2}'
+latex2sympy(tex)
+# => "Matrix([[4*k + 1, 5*k + 2, 6*k + 3], [4, 5, 6], [7, 8, 9]])"
+
+# You can compose the transform with comma ","
+# and grammar "\xrightarrow[4r_3]{2r_1, 3r_2}"
+# Remember the priority of "{}" is higher than "[]"
+tex = matrix + r'\xrightarrow[4r_3]{2r_1, 3r_2}'
+latex2sympy(tex)
+# => "Matrix([[2, 4, 6], [12, 15, 18], [28, 32, 36]])"
+```
+
+ Variances
+
+``` python
+from latex2sympy2 import latex2sympy, variances, var, set_variances
+
+# Assign x a value of 1
+latex2sympy(r"x = 1")
+
+# Calculate x + y
+latex2sympy(r"x + y")
+# => "y + 1"
+
+# Get all variances
+print(variances)
+# => "{x: 1}"
+
+# Get variance of "x"
+print(var["x"])
+# => "1"
+
+# Reset all variances
+set_variances({})
+latex2sympy(r"x + y")
+# => "x + y"
+```
+
+
+Contributing
+
+If you want to add a new grammar, you can fork the code from [OrangeX4/latex2sympy](https://github.com/OrangeX4/latex2sympy).
+
+* To modify parser grammar, view the existing structure in `PS.g4`.
+* To modify the action associated with each grammar, look into `latex2sympy.py`.
+
+Contributors are welcome! Feel free to open a pull request or an issue.

latex2sympy/dev-requirements.in

@@ -0,0 +1,8 @@
+-r requirements.txt
+# Development
+pip-tools
+pytest
+pytest-cov
+pycodestyle
+autopep8
+-e .

latex2sympy/dev-requirements.txt

@@ -0,0 +1,60 @@
+#
+# This file is autogenerated by pip-compile with Python 3.10
+# by the following command:
+#
+#    pip-compile dev-requirements.in
+#
+    # via -r dev-requirements.in
+antlr4-python3-runtime==4.11.1
+    # via
+    #   -r requirements.txt
+    #   latex2sympy2
+atomicwrites==1.3.0
+    # via pytest
+attrs==19.3.0
+    # via pytest
+autopep8==1.4.4
+    # via -r dev-requirements.in
+click==7.0
+    # via pip-tools
+coverage==4.5.4
+    # via pytest-cov
+more-itertools==7.2.0
+    # via pytest
+mpmath==1.3.0
+    # via
+    #   -r requirements.txt
+    #   sympy
+packaging==19.2
+    # via pytest
+pip-tools==4.2.0
+    # via -r dev-requirements.in
+pluggy==0.13.0
+    # via pytest
+py==1.8.0
+    # via pytest
+pycodestyle==2.5.0
+    # via
+    #   -r dev-requirements.in
+    #   autopep8
+pyparsing==2.4.4
+    # via packaging
+pytest==5.2.2
+    # via
+    #   -r dev-requirements.in
+    #   pytest-cov
+pytest-cov==2.8.1
+    # via -r dev-requirements.in
+six==1.13.0
+    # via
+    #   packaging
+    #   pip-tools
+sympy==1.12
+    # via
+    #   -r requirements.txt
+    #   latex2sympy2
+wcwidth==0.1.7
+    # via pytest
+
+# THIS MUST BE MAINTAINED AS-IS
+-e .

latex2sympy/gen/PS.interp

@@ -0,0 +1,462 @@
+token literal names:
+null
+'\\acute'
+'\\bar'
+'\\overline'
+'\\breve'
+'\\check'
+'\\widecheck'
+'\\dot'
+'\\ddot'
+'\\grave'
+'\\hat'
+'\\tilde'
+'\\widetilde'
+'\\vec'
+'\\overrightarrow'
+'\\bm'
+'\\boldsymbol'
+'\\text'
+'\\textit'
+'\\mathbb'
+'\\mathbin'
+'\\mathbf'
+'\\mathcal'
+'\\mathclap'
+'\\mathclose'
+'\\mathellipsis'
+'\\mathfrak'
+'\\mathinner'
+'\\mathnormal'
+'\\mathop'
+'\\mathopen'
+'\\mathord'
+'\\mathpunct'
+'\\mathrel'
+'\\mathring'
+'\\mathrlap'
+'\\mathrm'
+'\\mathscr'
+'\\mathsf'
+'\\mathsterling'
+'\\mathtt'
+'^T'
+'^{T}'
+'^{\\top}'
+'\''
+null
+'\\$'
+'+'
+'-'
+'*'
+null
+'('
+')'
+'\\lgroup'
+'\\rgroup'
+'{'
+'}'
+'\\{'
+'\\}'
+'\\lbrace'
+'\\rbrace'
+'['
+']'
+'\\lbrack'
+'\\rbrack'
+'|'
+'\\lvert'
+'\\rvert'
+'\\vert'
+'\\|'
+'\\lfloor'
+'\\rfloor'
+'\\llcorner'
+'\\lrcorner'
+'\\lceil'
+'\\rceil'
+'\\ulcorner'
+'\\urcorner'
+'\\left'
+'\\right'
+'\\mleft'
+'\\mright'
+'\\lim'
+null
+'\\int'
+'\\sum'
+'\\prod'
+'\\log'
+'\\ln'
+'\\exp'
+'\\sin'
+'\\cos'
+'\\tan'
+'\\csc'
+'\\sec'
+'\\cot'
+'\\arcsin'
+'\\arccos'
+'\\arctan'
+'\\arccsc'
+'\\arcsec'
+'\\arccot'
+'\\sinh'
+'\\cosh'
+'\\tanh'
+'\\arsinh'
+'\\arcosh'
+'\\artanh'
+'\\arcsinh'
+'\\arccosh'
+'\\arctanh'
+'arsinh'
+'arcsinh'
+'arcosh'
+'arccosh'
+'artanh'
+'arctanh'
+'gcd'
+'lcm'
+'floor'
+'ceil'
+'\\sqrt'
+'\\gcd'
+'\\lcm'
+'\\floor'
+'\\ceil'
+'\\max'
+'\\min'
+'\\det'
+'eye'
+'zeros'
+'ones'
+'cols'
+'rows'
+'diag'
+'norm'
+'rank'
+null
+'rref'
+'hstack'
+'vstack'
+null
+'nullspace'
+null
+null
+null
+null
+'\\times'
+'\\cdot'
+'\\div'
+'\\frac'
+null
+'\\choose'
+'\\mod'
+'\\mathit'
+'\\operatorname'
+'matrix'
+'pmatrix'
+'bmatrix'
+'vmatrix'
+null
+null
+null
+null
+null
+'&'
+'\\\\'
+'_'
+'^'
+':'
+';'
+','
+'.'
+null
+null
+'E'
+null
+null
+null
+null
+null
+'\\in'
+'='
+null
+'<'
+null
+'>'
+null
+null
+'!'
+null
+null
+null
+null
+null
+
+token symbolic names:
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+null
+WS
+DOLLAR_SIGN
+ADD
+SUB
+MUL
+DIV
+L_PAREN
+R_PAREN
+L_GROUP
+R_GROUP
+L_BRACE
+R_BRACE
+L_BRACE_VISUAL
+R_BRACE_VISUAL
+L_BRACE_CMD
+R_BRACE_CMD
+L_BRACKET
+R_BRACKET
+L_BRACK
+R_BRACK
+BAR
+L_VERT
+R_VERT
+VERT
+NORM
+L_FLOOR
+R_FLOOR
+LL_CORNER
+LR_CORNER
+L_CEIL
+R_CEIL
+UL_CORNER
+UR_CORNER
+L_LEFT
+R_RIGHT
+ML_LEFT
+MR_RIGHT
+FUNC_LIM
+LIM_APPROACH_SYM
+FUNC_INT
+FUNC_SUM
+FUNC_PROD
+FUNC_LOG
+FUNC_LN
+FUNC_EXP
+FUNC_SIN
+FUNC_COS
+FUNC_TAN
+FUNC_CSC
+FUNC_SEC
+FUNC_COT
+FUNC_ARCSIN
+FUNC_ARCCOS
+FUNC_ARCTAN
+FUNC_ARCCSC
+FUNC_ARCSEC
+FUNC_ARCCOT
+FUNC_SINH
+FUNC_COSH
+FUNC_TANH
+FUNC_ARSINH
+FUNC_ARCOSH
+FUNC_ARTANH
+FUNC_ARCSINH
+FUNC_ARCCOSH
+FUNC_ARCTANH
+FUNC_ARSINH_NAME
+FUNC_ARCSINH_NAME
+FUNC_ARCOSH_NAME
+FUNC_ARCCOSH_NAME
+FUNC_ARTANH_NAME
+FUNC_ARCTANH_NAME
+FUNC_GCD_NAME
+FUNC_LCM_NAME
+FUNC_FLOOR_NAME
+FUNC_CEIL_NAME
+FUNC_SQRT
+FUNC_GCD
+FUNC_LCM
+FUNC_FLOOR
+FUNC_CEIL
+FUNC_MAX
+FUNC_MIN
+FUNC_DET
+FUNC_EYE_NAME
+FUNC_ZEROS_NAME
+FUNC_ONES_NAME
+FUNC_COLS_NAME
+FUNC_ROWS_NAME
+FUNC_DIAG_NAME
+FUNC_NORM_NAME
+FUNC_RANK_NAME
+FUNC_TRACE_NAME
+FUNC_RREF_NAME
+FUNC_HSTACK_NAME
+FUNC_VSTACK_NAME
+FUNC_ORTHOGONALIZE_NAME
+FUNC_NULLSPACE_NAME
+FUNC_DIAGONALIZE_NAME
+FUNC_EIGENVALS_NAME
+FUNC_EIGENVECTORS_NAME
+FUNC_SVD_NAME
+CMD_TIMES
+CMD_CDOT
+CMD_DIV
+CMD_FRAC
+CMD_BINOM
+CMD_CHOOSE
+CMD_MOD
+CMD_MATHIT
+CMD_OPERATORNAME
+MATRIX_TYPE_MATRIX
+MATRIX_TYPE_PMATRIX
+MATRIX_TYPE_BMATRIX
+MATRIX_TYPE_DET
+MATRIX_TYPES
+CMD_MATRIX_START
+CMD_MATRIX_END
+CMD_DET_START
+CMD_DET_END
+MATRIX_DEL_COL
+MATRIX_DEL_ROW
+UNDERSCORE
+CARET
+COLON
+SEMICOLON
+COMMA
+PERIOD
+DIFFERENTIAL
+EXP_E
+E_NOTATION_E
+LETTER_NO_E
+MATRIX_XRIGHTARROW
+TRANSFORM_EXCHANGE
+NUMBER
+E_NOTATION
+IN
+ASSIGNMENT
+EQUAL
+LT
+LTE
+GT
+GTE
+UNEQUAL
+BANG
+PERCENT_NUMBER
+GREEK_CMD
+OTHER_SYMBOL_CMD
+SYMBOL
+VARIABLE
+
+rule names:
+accent_symbol
+math
+transpose
+transform_atom
+transform_scale
+transform_swap
+transform_assignment
+elementary_transform
+elementary_transforms
+matrix
+det
+matrix_row
+relation
+relation_list
+relation_list_content
+equality
+expr
+additive
+mp
+mp_nofunc
+unary
+unary_nofunc
+postfix
+postfix_nofunc
+postfix_op
+eval_at
+eval_at_sub
+eval_at_sup
+exp
+exp_nofunc
+comp
+comp_nofunc
+group
+norm_group
+abs_group
+floor_group
+ceil_group
+accent
+atom_expr_no_supexpr
+atom_expr
+atom
+mathit
+mathit_text
+frac
+binom
+func_normal_functions_single_arg
+func_normal_functions_multi_arg
+func_operator_names_single_arg
+func_operator_names_multi_arg
+func_normal_single_arg
+func_normal_multi_arg
+func
+args
+func_common_args
+limit_sub
+func_single_arg
+func_single_arg_noparens
+func_multi_arg
+func_multi_arg_noparens
+subexpr
+supexpr
+subeq
+supeq
+
+
+atn:
+[4, 1, 194, 1046, 2, 0, 7, 0, 2, 1, 7, 1, 2, 2, 7, 2, 2, 3, 7, 3, 2, 4, 7, 4, 2, 5, 7, 5, 2, 6, 7, 6, 2, 7, 7, 7, 2, 8, 7, 8, 2, 9, 7, 9, 2, 10, 7, 10, 2, 11, 7, 11, 2, 12, 7, 12, 2, 13, 7, 13, 2, 14, 7, 14, 2, 15, 7, 15, 2, 16, 7, 16, 2, 17, 7, 17, 2, 18, 7, 18, 2, 19, 7, 19, 2, 20, 7, 20, 2, 21, 7, 21, 2, 22, 7, 22, 2, 23, 7, 23, 2, 24, 7, 24, 2, 25, 7, 25, 2, 26, 7, 26, 2, 27, 7, 27, 2, 28, 7, 28, 2, 29, 7, 29, 2, 30, 7, 30, 2, 31, 7, 31, 2, 32, 7, 32, 2, 33, 7, 33, 2, 34, 7, 34, 2, 35, 7, 35, 2, 36, 7, 36, 2, 37, 7, 37, 2, 38, 7, 38, 2, 39, 7, 39, 2, 40, 7, 40, 2, 41, 7, 41, 2, 42, 7, 42, 2, 43, 7, 43, 2, 44, 7, 44, 2, 45, 7, 45, 2, 46, 7, 46, 2, 47, 7, 47, 2, 48, 7, 48, 2, 49, 7, 49, 2, 50, 7, 50, 2, 51, 7, 51, 2, 52, 7, 52, 2, 53, 7, 53, 2, 54, 7, 54, 2, 55, 7, 55, 2, 56, 7, 56, 2, 57, 7, 57, 2, 58, 7, 58, 2, 59, 7, 59, 2, 60, 7, 60, 2, 61, 7, 61, 2, 62, 7, 62, 1, 0, 1, 0, 1, 1, 1, 1, 3, 1, 131, 8, 1, 1, 2, 1, 2, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 3, 3, 141, 8, 3, 1, 4, 1, 4, 1, 4, 1, 4, 3, 4, 147, 8, 4, 1, 4, 1, 4, 1, 5, 1, 5, 1, 5, 1, 5, 1, 6, 1, 6, 1, 6, 1, 7, 1, 7, 1, 7, 3, 7, 161, 8, 7, 1, 8, 1, 8, 1, 8, 5, 8, 166, 8, 8, 10, 8, 12, 8, 169, 9, 8, 1, 9, 1, 9, 1, 9, 1, 9, 5, 9, 175, 8, 9, 10, 9, 12, 9, 178, 9, 9, 1, 9, 3, 9, 181, 8, 9, 1, 9, 1, 9, 1, 9, 1, 9, 1, 9, 1, 9, 3, 9, 189, 8, 9, 1, 9, 1, 9, 1, 9, 1, 9, 3, 9, 195, 8, 9, 1, 10, 1, 10, 1, 10, 1, 10, 5, 10, 201, 8, 10, 10, 10, 12, 10, 204, 9, 10, 1, 10, 3, 10, 207, 8, 10, 1, 10, 1, 10, 1, 11, 1, 11, 1, 11, 5, 11, 214, 8, 11, 10, 11, 12, 11, 217, 9, 11, 1, 12, 1, 12, 1, 12, 1, 12, 1, 12, 1, 12, 5, 12, 225, 8, 12, 10, 12, 12, 12, 228, 9, 12, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 3, 13, 267, 8, 13, 1, 14, 1, 14, 1, 14, 1, 14, 1, 14, 5, 14, 274, 8, 14, 10, 14, 12, 14, 277, 9, 14, 1, 14, 1, 14, 1, 14, 1, 14, 1, 14, 5, 14, 284, 8, 14, 10, 14, 12, 14, 287, 9, 14, 3, 14, 289, 8, 14, 1, 15, 1, 15, 1, 15, 1, 15, 1, 16, 1, 16, 1, 17, 1, 17, 1, 17, 1, 17, 1, 17, 1, 17, 5, 17, 303, 8, 17, 10, 17, 12, 17, 306, 9, 17, 1, 18, 1, 18, 1, 18, 1, 18, 1, 18, 1, 18, 5, 18, 314, 8, 18, 10, 18, 12, 18, 317, 9, 18, 1, 19, 1, 19, 1, 19, 1, 19, 1, 19, 1, 19, 5, 19, 325, 8, 19, 10, 19, 12, 19, 328, 9, 19, 1, 20, 1, 20, 1, 20, 4, 20, 333, 8, 20, 11, 20, 12, 20, 334, 3, 20, 337, 8, 20, 1, 21, 1, 21, 1, 21, 1, 21, 5, 21, 343, 8, 21, 10, 21, 12, 21, 346, 9, 21, 3, 21, 348, 8, 21, 1, 22, 1, 22, 5, 22, 352, 8, 22, 10, 22, 12, 22, 355, 9, 22, 1, 23, 1, 23, 5, 23, 359, 8, 23, 10, 23, 12, 23, 362, 9, 23, 1, 24, 1, 24, 1, 24, 3, 24, 367, 8, 24, 1, 25, 1, 25, 1, 25, 1, 25, 1, 25, 1, 25, 3, 25, 375, 8, 25, 1, 26, 1, 26, 1, 26, 1, 26, 3, 26, 381, 8, 26, 1, 26, 1, 26, 1, 27, 1, 27, 1, 27, 1, 27, 3, 27, 389, 8, 27, 1, 27, 1, 27, 1, 28, 1, 28, 1, 28, 1, 28, 1, 28, 1, 28, 1, 28, 1, 28, 1, 28, 1, 28, 3, 28, 403, 8, 28, 1, 28, 3, 28, 406, 8, 28, 5, 28, 408, 8, 28, 10, 28, 12, 28, 411, 9, 28, 1, 29, 1, 29, 1, 29, 1, 29, 1, 29, 1, 29, 1, 29, 1, 29, 1, 29, 1, 29, 3, 29, 423, 8, 29, 1, 29, 3, 29, 426, 8, 29, 5, 29, 428, 8, 29, 10, 29, 12, 29, 431, 9, 29, 1, 30, 1, 30, 1, 30, 1, 30, 1, 30, 1, 30, 1, 30, 1, 30, 1, 30, 1, 30, 1, 30, 3, 30, 444, 8, 30, 1, 31, 1, 31, 1, 31, 1, 31, 1, 31, 1, 31, 1, 31, 1, 31, 1, 31, 1, 31, 3, 31, 456, 8, 31, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 1, 32, 3, 32, 570, 8, 32, 1, 33, 1, 33, 1, 33, 1, 33, 1, 33, 1, 33, 1, 33, 1, 33, 1, 33, 1, 33, 1, 33, 1, 33, 1, 33, 1, 33, 1, 33, 1, 33, 3, 33, 588, 8, 33, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 1, 34, 3, 34, 638, 8, 34, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 3, 35, 672, 8, 35, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 3, 36, 706, 8, 36, 1, 37, 1, 37, 1, 37, 1, 37, 1, 37, 1, 38, 1, 38, 1, 38, 1, 38, 3, 38, 717, 8, 38, 1, 38, 3, 38, 720, 8, 38, 1, 39, 1, 39, 1, 39, 1, 39, 3, 39, 726, 8, 39, 1, 39, 1, 39, 1, 39, 1, 39, 1, 39, 1, 39, 1, 39, 1, 39, 3, 39, 736, 8, 39, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 3, 40, 746, 8, 40, 1, 41, 1, 41, 1, 41, 1, 41, 1, 41, 1, 42, 4, 42, 754, 8, 42, 11, 42, 12, 42, 755, 1, 43, 1, 43, 1, 43, 1, 43, 1, 43, 1, 43, 1, 43, 1, 43, 1, 44, 1, 44, 1, 44, 1, 44, 1, 44, 1, 44, 1, 44, 1, 44, 1, 44, 1, 44, 1, 44, 1, 44, 1, 44, 1, 44, 3, 44, 780, 8, 44, 1, 45, 1, 45, 1, 46, 1, 46, 1, 47, 1, 47, 1, 48, 1, 48, 1, 49, 1, 49, 1, 49, 1, 49, 1, 49, 1, 49, 3, 49, 796, 8, 49, 1, 50, 1, 50, 1, 50, 1, 50, 1, 50, 1, 50, 3, 50, 804, 8, 50, 1, 51, 1, 51, 3, 51, 808, 8, 51, 1, 51, 3, 51, 811, 8, 51, 1, 51, 3, 51, 814, 8, 51, 1, 51, 3, 51, 817, 8, 51, 3, 51, 819, 8, 51, 1, 51, 3, 51, 822, 8, 51, 1, 51, 1, 51, 1, 51, 3, 51, 827, 8, 51, 1, 51, 1, 51, 1, 51, 3, 51, 832, 8, 51, 1, 51, 1, 51, 1, 51, 3, 51, 837, 8, 51, 1, 51, 1, 51, 1, 51, 3, 51, 842, 8, 51, 1, 51, 1, 51, 3, 51, 846, 8, 51, 1, 51, 3, 51, 849, 8, 51, 1, 51, 3, 51, 852, 8, 51, 1, 51, 3, 51, 855, 8, 51, 3, 51, 857, 8, 51, 1, 51, 3, 51, 860, 8, 51, 1, 51, 1, 51, 1, 51, 3, 51, 865, 8, 51, 1, 51, 1, 51, 1, 51, 3, 51, 870, 8, 51, 1, 51, 1, 51, 1, 51, 3, 51, 875, 8, 51, 1, 51, 1, 51, 1, 51, 3, 51, 880, 8, 51, 1, 51, 1, 51, 3, 51, 884, 8, 51, 1, 51, 3, 51, 887, 8, 51, 1, 51, 1, 51, 1, 51, 1, 51, 3, 51, 893, 8, 51, 1, 51, 1, 51, 3, 51, 897, 8, 51, 1, 51, 1, 51, 3, 51, 901, 8, 51, 1, 51, 1, 51, 1, 51, 1, 51, 3, 51, 907, 8, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 3, 51, 932, 8, 51, 1, 51, 3, 51, 935, 8, 51, 1, 51, 1, 51, 1, 51, 3, 51, 940, 8, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 3, 51, 947, 8, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 3, 51, 960, 8, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 3, 51, 970, 8, 51, 3, 51, 972, 8, 51, 1, 52, 1, 52, 1, 52, 1, 52, 1, 52, 3, 52, 979, 8, 52, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 3, 53, 989, 8, 53, 1, 54, 1, 54, 1, 54, 1, 54, 1, 54, 1, 54, 1, 54, 1, 54, 1, 54, 3, 54, 1000, 8, 54, 1, 54, 1, 54, 1, 55, 1, 55, 1, 56, 1, 56, 1, 57, 1, 57, 1, 57, 1, 57, 1, 57, 3, 57, 1013, 8, 57, 1, 58, 1, 58, 1, 59, 1, 59, 1, 59, 1, 59, 1, 59, 3, 59, 1022, 8, 59, 1, 59, 1, 59, 3, 59, 1026, 8, 59, 1, 60, 1, 60, 1, 60, 1, 60, 1, 60, 1, 60, 3, 60, 1034, 8, 60, 1, 61, 1, 61, 1, 61, 1, 61, 1, 61, 1, 62, 1, 62, 1, 62, 1, 62, 1, 62, 1, 62, 0, 6, 24, 34, 36, 38, 56, 58, 63, 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122, 124, 0, 15, 2, 0, 1, 40, 154, 154, 1, 0, 41, 44, 1, 0, 181, 188, 1, 0, 182, 183, 1, 0, 47, 48, 4, 0, 49, 50, 147, 149, 153, 153, 169, 169, 1, 0, 174, 176, 3, 0, 87, 110, 124, 125, 128, 128, 2, 0, 122, 123, 126, 127, 6, 0, 111, 116, 119, 120, 129, 129, 132, 133, 135, 138, 142, 146, 4, 0, 117, 118, 130, 131, 134, 134, 139, 141, 2, 0, 51, 51, 61, 61, 2, 0, 52, 52, 62, 62, 1, 0, 85, 86, 2, 0, 176, 176, 191, 192, 1164, 0, 126, 1, 0, 0, 0, 2, 130, 1, 0, 0, 0, 4, 132, 1, 0, 0, 0, 6, 134, 1, 0, 0, 0, 8, 146, 1, 0, 0, 0, 10, 150, 1, 0, 0, 0, 12, 154, 1, 0, 0, 0, 14, 160, 1, 0, 0, 0, 16, 162, 1, 0, 0, 0, 18, 170, 1, 0, 0, 0, 20, 196, 1, 0, 0, 0, 22, 210, 1, 0, 0, 0, 24, 218, 1, 0, 0, 0, 26, 266, 1, 0, 0, 0, 28, 288, 1, 0, 0, 0, 30, 290, 1, 0, 0, 0, 32, 294, 1, 0, 0, 0, 34, 296, 1, 0, 0, 0, 36, 307, 1, 0, 0, 0, 38, 318, 1, 0, 0, 0, 40, 336, 1, 0, 0, 0, 42, 347, 1, 0, 0, 0, 44, 349, 1, 0, 0, 0, 46, 356, 1, 0, 0, 0, 48, 366, 1, 0, 0, 0, 50, 368, 1, 0, 0, 0, 52, 376, 1, 0, 0, 0, 54, 384, 1, 0, 0, 0, 56, 392, 1, 0, 0, 0, 58, 412, 1, 0, 0, 0, 60, 443, 1, 0, 0, 0, 62, 455, 1, 0, 0, 0, 64, 569, 1, 0, 0, 0, 66, 587, 1, 0, 0, 0, 68, 637, 1, 0, 0, 0, 70, 671, 1, 0, 0, 0, 72, 705, 1, 0, 0, 0, 74, 707, 1, 0, 0, 0, 76, 716, 1, 0, 0, 0, 78, 725, 1, 0, 0, 0, 80, 745, 1, 0, 0, 0, 82, 747, 1, 0, 0, 0, 84, 753, 1, 0, 0, 0, 86, 757, 1, 0, 0, 0, 88, 779, 1, 0, 0, 0, 90, 781, 1, 0, 0, 0, 92, 783, 1, 0, 0, 0, 94, 785, 1, 0, 0, 0, 96, 787, 1, 0, 0, 0, 98, 795, 1, 0, 0, 0, 100, 803, 1, 0, 0, 0, 102, 971, 1, 0, 0, 0, 104, 978, 1, 0, 0, 0, 106, 988, 1, 0, 0, 0, 108, 990, 1, 0, 0, 0, 110, 1003, 1, 0, 0, 0, 112, 1005, 1, 0, 0, 0, 114, 1012, 1, 0, 0, 0, 116, 1014, 1, 0, 0, 0, 118, 1016, 1, 0, 0, 0, 120, 1027, 1, 0, 0, 0, 122, 1035, 1, 0, 0, 0, 124, 1040, 1, 0, 0, 0, 126, 127, 7, 0, 0, 0, 127, 1, 1, 0, 0, 0, 128, 131, 3, 24, 12, 0, 129, 131, 3, 26, 13, 0, 130, 128, 1, 0, 0, 0, 130, 129, 1, 0, 0, 0, 131, 3, 1, 0, 0, 0, 132, 133, 7, 1, 0, 0, 133, 5, 1, 0, 0, 0, 134, 135, 5, 176, 0, 0, 135, 140, 5, 167, 0, 0, 136, 141, 5, 179, 0, 0, 137, 138, 5, 55, 0, 0, 138, 139, 5, 179, 0, 0, 139, 141, 5, 56, 0, 0, 140, 136, 1, 0, 0, 0, 140, 137, 1, 0, 0, 0, 141, 7, 1, 0, 0, 0, 142, 147, 3, 32, 16, 0, 143, 147, 3, 64, 32, 0, 144, 147, 5, 47, 0, 0, 145, 147, 5, 48, 0, 0, 146, 142, 1, 0, 0, 0, 146, 143, 1, 0, 0, 0, 146, 144, 1, 0, 0, 0, 146, 145, 1, 0, 0, 0, 147, 148, 1, 0, 0, 0, 148, 149, 3, 6, 3, 0, 149, 9, 1, 0, 0, 0, 150, 151, 3, 6, 3, 0, 151, 152, 5, 178, 0, 0, 152, 153, 3, 6, 3, 0, 153, 11, 1, 0, 0, 0, 154, 155, 3, 6, 3, 0, 155, 156, 3, 8, 4, 0, 156, 13, 1, 0, 0, 0, 157, 161, 3, 12, 6, 0, 158, 161, 3, 8, 4, 0, 159, 161, 3, 10, 5, 0, 160, 157, 1, 0, 0, 0, 160, 158, 1, 0, 0, 0, 160, 159, 1, 0, 0, 0, 161, 15, 1, 0, 0, 0, 162, 167, 3, 14, 7, 0, 163, 164, 5, 171, 0, 0, 164, 166, 3, 14, 7, 0, 165, 163, 1, 0, 0, 0, 166, 169, 1, 0, 0, 0, 167, 165, 1, 0, 0, 0, 167, 168, 1, 0, 0, 0, 168, 17, 1, 0, 0, 0, 169, 167, 1, 0, 0, 0, 170, 171, 5, 161, 0, 0, 171, 176, 3, 22, 11, 0, 172, 173, 5, 166, 0, 0, 173, 175, 3, 22, 11, 0, 174, 172, 1, 0, 0, 0, 175, 178, 1, 0, 0, 0, 176, 174, 1, 0, 0, 0, 176, 177, 1, 0, 0, 0, 177, 180, 1, 0, 0, 0, 178, 176, 1, 0, 0, 0, 179, 181, 5, 166, 0, 0, 180, 179, 1, 0, 0, 0, 180, 181, 1, 0, 0, 0, 181, 182, 1, 0, 0, 0, 182, 194, 5, 162, 0, 0, 183, 188, 5, 177, 0, 0, 184, 185, 5, 61, 0, 0, 185, 186, 3, 16, 8, 0, 186, 187, 5, 62, 0, 0, 187, 189, 1, 0, 0, 0, 188, 184, 1, 0, 0, 0, 188, 189, 1, 0, 0, 0, 189, 190, 1, 0, 0, 0, 190, 191, 5, 55, 0, 0, 191, 192, 3, 16, 8, 0, 192, 193, 5, 56, 0, 0, 193, 195, 1, 0, 0, 0, 194, 183, 1, 0, 0, 0, 194, 195, 1, 0, 0, 0, 195, 19, 1, 0, 0, 0, 196, 197, 5, 163, 0, 0, 197, 202, 3, 22, 11, 0, 198, 199, 5, 166, 0, 0, 199, 201, 3, 22, 11, 0, 200, 198, 1, 0, 0, 0, 201, 204, 1, 0, 0, 0, 202, 200, 1, 0, 0, 0, 202, 203, 1, 0, 0, 0, 203, 206, 1, 0, 0, 0, 204, 202, 1, 0, 0, 0, 205, 207, 5, 166, 0, 0, 206, 205, 1, 0, 0, 0, 206, 207, 1, 0, 0, 0, 207, 208, 1, 0, 0, 0, 208, 209, 5, 164, 0, 0, 209, 21, 1, 0, 0, 0, 210, 215, 3, 32, 16, 0, 211, 212, 5, 165, 0, 0, 212, 214, 3, 32, 16, 0, 213, 211, 1, 0, 0, 0, 214, 217, 1, 0, 0, 0, 215, 213, 1, 0, 0, 0, 215, 216, 1, 0, 0, 0, 216, 23, 1, 0, 0, 0, 217, 215, 1, 0, 0, 0, 218, 219, 6, 12, -1, 0, 219, 220, 3, 32, 16, 0, 220, 226, 1, 0, 0, 0, 221, 222, 10, 2, 0, 0, 222, 223, 7, 2, 0, 0, 223, 225, 3, 24, 12, 3, 224, 221, 1, 0, 0, 0, 225, 228, 1, 0, 0, 0, 226, 224, 1, 0, 0, 0, 226, 227, 1, 0, 0, 0, 227, 25, 1, 0, 0, 0, 228, 226, 1, 0, 0, 0, 229, 267, 3, 28, 14, 0, 230, 231, 5, 61, 0, 0, 231, 232, 3, 28, 14, 0, 232, 233, 5, 62, 0, 0, 233, 267, 1, 0, 0, 0, 234, 235, 5, 55, 0, 0, 235, 236, 3, 28, 14, 0, 236, 237, 5, 56, 0, 0, 237, 267, 1, 0, 0, 0, 238, 239, 5, 57, 0, 0, 239, 240, 3, 28, 14, 0, 240, 241, 5, 58, 0, 0, 241, 267, 1, 0, 0, 0, 242, 243, 5, 78, 0, 0, 243, 244, 5, 61, 0, 0, 244, 245, 3, 28, 14, 0, 245, 246, 5, 79, 0, 0, 246, 247, 5, 62, 0, 0, 247, 267, 1, 0, 0, 0, 248, 249, 5, 78, 0, 0, 249, 250, 5, 57, 0, 0, 250, 251, 3, 28, 14, 0, 251, 252, 5, 79, 0, 0, 252, 253, 5, 58, 0, 0, 253, 267, 1, 0, 0, 0, 254, 255, 5, 80, 0, 0, 255, 256, 5, 61, 0, 0, 256, 257, 3, 28, 14, 0, 257, 258, 5, 81, 0, 0, 258, 259, 5, 62, 0, 0, 259, 267, 1, 0, 0, 0, 260, 261, 5, 80, 0, 0, 261, 262, 5, 57, 0, 0, 262, 263, 3, 28, 14, 0, 263, 264, 5, 81, 0, 0, 264, 265, 5, 58, 0, 0, 265, 267, 1, 0, 0, 0, 266, 229, 1, 0, 0, 0, 266, 230, 1, 0, 0, 0, 266, 234, 1, 0, 0, 0, 266, 238, 1, 0, 0, 0, 266, 242, 1, 0, 0, 0, 266, 248, 1, 0, 0, 0, 266, 254, 1, 0, 0, 0, 266, 260, 1, 0, 0, 0, 267, 27, 1, 0, 0, 0, 268, 269, 3, 24, 12, 0, 269, 270, 5, 171, 0, 0, 270, 275, 3, 24, 12, 0, 271, 272, 5, 171, 0, 0, 272, 274, 3, 24, 12, 0, 273, 271, 1, 0, 0, 0, 274, 277, 1, 0, 0, 0, 275, 273, 1, 0, 0, 0, 275, 276, 1, 0, 0, 0, 276, 289, 1, 0, 0, 0, 277, 275, 1, 0, 0, 0, 278, 279, 3, 24, 12, 0, 279, 280, 5, 170, 0, 0, 280, 285, 3, 24, 12, 0, 281, 282, 5, 170, 0, 0, 282, 284, 3, 24, 12, 0, 283, 281, 1, 0, 0, 0, 284, 287, 1, 0, 0, 0, 285, 283, 1, 0, 0, 0, 285, 286, 1, 0, 0, 0, 286, 289, 1, 0, 0, 0, 287, 285, 1, 0, 0, 0, 288, 268, 1, 0, 0, 0, 288, 278, 1, 0, 0, 0, 289, 29, 1, 0, 0, 0, 290, 291, 3, 32, 16, 0, 291, 292, 7, 3, 0, 0, 292, 293, 3, 32, 16, 0, 293, 31, 1, 0, 0, 0, 294, 295, 3, 34, 17, 0, 295, 33, 1, 0, 0, 0, 296, 297, 6, 17, -1, 0, 297, 298, 3, 36, 18, 0, 298, 304, 1, 0, 0, 0, 299, 300, 10, 2, 0, 0, 300, 301, 7, 4, 0, 0, 301, 303, 3, 34, 17, 3, 302, 299, 1, 0, 0, 0, 303, 306, 1, 0, 0, 0, 304, 302, 1, 0, 0, 0, 304, 305, 1, 0, 0, 0, 305, 35, 1, 0, 0, 0, 306, 304, 1, 0, 0, 0, 307, 308, 6, 18, -1, 0, 308, 309, 3, 40, 20, 0, 309, 315, 1, 0, 0, 0, 310, 311, 10, 2, 0, 0, 311, 312, 7, 5, 0, 0, 312, 314, 3, 36, 18, 3, 313, 310, 1, 0, 0, 0, 314, 317, 1, 0, 0, 0, 315, 313, 1, 0, 0, 0, 315, 316, 1, 0, 0, 0, 316, 37, 1, 0, 0, 0, 317, 315, 1, 0, 0, 0, 318, 319, 6, 19, -1, 0, 319, 320, 3, 42, 21, 0, 320, 326, 1, 0, 0, 0, 321, 322, 10, 2, 0, 0, 322, 323, 7, 5, 0, 0, 323, 325, 3, 38, 19, 3, 324, 321, 1, 0, 0, 0, 325, 328, 1, 0, 0, 0, 326, 324, 1, 0, 0, 0, 326, 327, 1, 0, 0, 0, 327, 39, 1, 0, 0, 0, 328, 326, 1, 0, 0, 0, 329, 330, 7, 4, 0, 0, 330, 337, 3, 40, 20, 0, 331, 333, 3, 44, 22, 0, 332, 331, 1, 0, 0, 0, 333, 334, 1, 0, 0, 0, 334, 332, 1, 0, 0, 0, 334, 335, 1, 0, 0, 0, 335, 337, 1, 0, 0, 0, 336, 329, 1, 0, 0, 0, 336, 332, 1, 0, 0, 0, 337, 41, 1, 0, 0, 0, 338, 339, 7, 4, 0, 0, 339, 348, 3, 42, 21, 0, 340, 344, 3, 44, 22, 0, 341, 343, 3, 46, 23, 0, 342, 341, 1, 0, 0, 0, 343, 346, 1, 0, 0, 0, 344, 342, 1, 0, 0, 0, 344, 345, 1, 0, 0, 0, 345, 348, 1, 0, 0, 0, 346, 344, 1, 0, 0, 0, 347, 338, 1, 0, 0, 0, 347, 340, 1, 0, 0, 0, 348, 43, 1, 0, 0, 0, 349, 353, 3, 56, 28, 0, 350, 352, 3, 48, 24, 0, 351, 350, 1, 0, 0, 0, 352, 355, 1, 0, 0, 0, 353, 351, 1, 0, 0, 0, 353, 354, 1, 0, 0, 0, 354, 45, 1, 0, 0, 0, 355, 353, 1, 0, 0, 0, 356, 360, 3, 58, 29, 0, 357, 359, 3, 48, 24, 0, 358, 357, 1, 0, 0, 0, 359, 362, 1, 0, 0, 0, 360, 358, 1, 0, 0, 0, 360, 361, 1, 0, 0, 0, 361, 47, 1, 0, 0, 0, 362, 360, 1, 0, 0, 0, 363, 367, 5, 189, 0, 0, 364, 367, 3, 50, 25, 0, 365, 367, 3, 4, 2, 0, 366, 363, 1, 0, 0, 0, 366, 364, 1, 0, 0, 0, 366, 365, 1, 0, 0, 0, 367, 49, 1, 0, 0, 0, 368, 374, 5, 65, 0, 0, 369, 375, 3, 54, 27, 0, 370, 375, 3, 52, 26, 0, 371, 372, 3, 54, 27, 0, 372, 373, 3, 52, 26, 0, 373, 375, 1, 0, 0, 0, 374, 369, 1, 0, 0, 0, 374, 370, 1, 0, 0, 0, 374, 371, 1, 0, 0, 0, 375, 51, 1, 0, 0, 0, 376, 377, 5, 167, 0, 0, 377, 380, 5, 55, 0, 0, 378, 381, 3, 32, 16, 0, 379, 381, 3, 30, 15, 0, 380, 378, 1, 0, 0, 0, 380, 379, 1, 0, 0, 0, 381, 382, 1, 0, 0, 0, 382, 383, 5, 56, 0, 0, 383, 53, 1, 0, 0, 0, 384, 385, 5, 168, 0, 0, 385, 388, 5, 55, 0, 0, 386, 389, 3, 32, 16, 0, 387, 389, 3, 30, 15, 0, 388, 386, 1, 0, 0, 0, 388, 387, 1, 0, 0, 0, 389, 390, 1, 0, 0, 0, 390, 391, 5, 56, 0, 0, 391, 55, 1, 0, 0, 0, 392, 393, 6, 28, -1, 0, 393, 394, 3, 60, 30, 0, 394, 409, 1, 0, 0, 0, 395, 396, 10, 2, 0, 0, 396, 402, 5, 168, 0, 0, 397, 403, 3, 80, 40, 0, 398, 399, 5, 55, 0, 0, 399, 400, 3, 32, 16, 0, 400, 401, 5, 56, 0, 0, 401, 403, 1, 0, 0, 0, 402, 397, 1, 0, 0, 0, 402, 398, 1, 0, 0, 0, 403, 405, 1, 0, 0, 0, 404, 406, 3, 118, 59, 0, 405, 404, 1, 0, 0, 0, 405, 406, 1, 0, 0, 0, 406, 408, 1, 0, 0, 0, 407, 395, 1, 0, 0, 0, 408, 411, 1, 0, 0, 0, 409, 407, 1, 0, 0, 0, 409, 410, 1, 0, 0, 0, 410, 57, 1, 0, 0, 0, 411, 409, 1, 0, 0, 0, 412, 413, 6, 29, -1, 0, 413, 414, 3, 62, 31, 0, 414, 429, 1, 0, 0, 0, 415, 416, 10, 2, 0, 0, 416, 422, 5, 168, 0, 0, 417, 423, 3, 80, 40, 0, 418, 419, 5, 55, 0, 0, 419, 420, 3, 32, 16, 0, 420, 421, 5, 56, 0, 0, 421, 423, 1, 0, 0, 0, 422, 417, 1, 0, 0, 0, 422, 418, 1, 0, 0, 0, 423, 425, 1, 0, 0, 0, 424, 426, 3, 118, 59, 0, 425, 424, 1, 0, 0, 0, 425, 426, 1, 0, 0, 0, 426, 428, 1, 0, 0, 0, 427, 415, 1, 0, 0, 0, 428, 431, 1, 0, 0, 0, 429, 427, 1, 0, 0, 0, 429, 430, 1, 0, 0, 0, 430, 59, 1, 0, 0, 0, 431, 429, 1, 0, 0, 0, 432, 444, 3, 64, 32, 0, 433, 444, 3, 66, 33, 0, 434, 444, 3, 68, 34, 0, 435, 444, 3, 70, 35, 0, 436, 444, 3, 72, 36, 0, 437, 444, 3, 102, 51, 0, 438, 444, 3, 80, 40, 0, 439, 444, 3, 86, 43, 0, 440, 444, 3, 88, 44, 0, 441, 444, 3, 18, 9, 0, 442, 444, 3, 20, 10, 0, 443, 432, 1, 0, 0, 0, 443, 433, 1, 0, 0, 0, 443, 434, 1, 0, 0, 0, 443, 435, 1, 0, 0, 0, 443, 436, 1, 0, 0, 0, 443, 437, 1, 0, 0, 0, 443, 438, 1, 0, 0, 0, 443, 439, 1, 0, 0, 0, 443, 440, 1, 0, 0, 0, 443, 441, 1, 0, 0, 0, 443, 442, 1, 0, 0, 0, 444, 61, 1, 0, 0, 0, 445, 456, 3, 64, 32, 0, 446, 456, 3, 66, 33, 0, 447, 456, 3, 68, 34, 0, 448, 456, 3, 70, 35, 0, 449, 456, 3, 72, 36, 0, 450, 456, 3, 80, 40, 0, 451, 456, 3, 86, 43, 0, 452, 456, 3, 88, 44, 0, 453, 456, 3, 18, 9, 0, 454, 456, 3, 20, 10, 0, 455, 445, 1, 0, 0, 0, 455, 446, 1, 0, 0, 0, 455, 447, 1, 0, 0, 0, 455, 448, 1, 0, 0, 0, 455, 449, 1, 0, 0, 0, 455, 450, 1, 0, 0, 0, 455, 451, 1, 0, 0, 0, 455, 452, 1, 0, 0, 0, 455, 453, 1, 0, 0, 0, 455, 454, 1, 0, 0, 0, 456, 63, 1, 0, 0, 0, 457, 458, 5, 51, 0, 0, 458, 459, 3, 32, 16, 0, 459, 460, 5, 52, 0, 0, 460, 570, 1, 0, 0, 0, 461, 462, 5, 53, 0, 0, 462, 463, 3, 32, 16, 0, 463, 464, 5, 54, 0, 0, 464, 570, 1, 0, 0, 0, 465, 466, 5, 55, 0, 0, 466, 467, 3, 32, 16, 0, 467, 468, 5, 56, 0, 0, 468, 570, 1, 0, 0, 0, 469, 470, 5, 57, 0, 0, 470, 471, 3, 32, 16, 0, 471, 472, 5, 58, 0, 0, 472, 570, 1, 0, 0, 0, 473, 474, 5, 59, 0, 0, 474, 475, 3, 32, 16, 0, 475, 476, 5, 60, 0, 0, 476, 570, 1, 0, 0, 0, 477, 478, 5, 61, 0, 0, 478, 479, 3, 32, 16, 0, 479, 480, 5, 62, 0, 0, 480, 570, 1, 0, 0, 0, 481, 482, 5, 63, 0, 0, 482, 483, 3, 32, 16, 0, 483, 484, 5, 64, 0, 0, 484, 570, 1, 0, 0, 0, 485, 486, 5, 78, 0, 0, 486, 487, 5, 51, 0, 0, 487, 488, 3, 32, 16, 0, 488, 489, 5, 79, 0, 0, 489, 490, 5, 52, 0, 0, 490, 570, 1, 0, 0, 0, 491, 492, 5, 78, 0, 0, 492, 493, 5, 53, 0, 0, 493, 494, 3, 32, 16, 0, 494, 495, 5, 79, 0, 0, 495, 496, 5, 54, 0, 0, 496, 570, 1, 0, 0, 0, 497, 498, 5, 78, 0, 0, 498, 499, 5, 55, 0, 0, 499, 500, 3, 32, 16, 0, 500, 501, 5, 79, 0, 0, 501, 502, 5, 56, 0, 0, 502, 570, 1, 0, 0, 0, 503, 504, 5, 78, 0, 0, 504, 505, 5, 57, 0, 0, 505, 506, 3, 32, 16, 0, 506, 507, 5, 79, 0, 0, 507, 508, 5, 58, 0, 0, 508, 570, 1, 0, 0, 0, 509, 510, 5, 78, 0, 0, 510, 511, 5, 59, 0, 0, 511, 512, 3, 32, 16, 0, 512, 513, 5, 79, 0, 0, 513, 514, 5, 60, 0, 0, 514, 570, 1, 0, 0, 0, 515, 516, 5, 78, 0, 0, 516, 517, 5, 61, 0, 0, 517, 518, 3, 32, 16, 0, 518, 519, 5, 79, 0, 0, 519, 520, 5, 62, 0, 0, 520, 570, 1, 0, 0, 0, 521, 522, 5, 78, 0, 0, 522, 523, 5, 63, 0, 0, 523, 524, 3, 32, 16, 0, 524, 525, 5, 79, 0, 0, 525, 526, 5, 64, 0, 0, 526, 570, 1, 0, 0, 0, 527, 528, 5, 80, 0, 0, 528, 529, 5, 51, 0, 0, 529, 530, 3, 32, 16, 0, 530, 531, 5, 81, 0, 0, 531, 532, 5, 52, 0, 0, 532, 570, 1, 0, 0, 0, 533, 534, 5, 80, 0, 0, 534, 535, 5, 53, 0, 0, 535, 536, 3, 32, 16, 0, 536, 537, 5, 81, 0, 0, 537, 538, 5, 54, 0, 0, 538, 570, 1, 0, 0, 0, 539, 540, 5, 80, 0, 0, 540, 541, 5, 55, 0, 0, 541, 542, 3, 32, 16, 0, 542, 543, 5, 81, 0, 0, 543, 544, 5, 56, 0, 0, 544, 570, 1, 0, 0, 0, 545, 546, 5, 80, 0, 0, 546, 547, 5, 57, 0, 0, 547, 548, 3, 32, 16, 0, 548, 549, 5, 81, 0, 0, 549, 550, 5, 58, 0, 0, 550, 570, 1, 0, 0, 0, 551, 552, 5, 80, 0, 0, 552, 553, 5, 59, 0, 0, 553, 554, 3, 32, 16, 0, 554, 555, 5, 81, 0, 0, 555, 556, 5, 60, 0, 0, 556, 570, 1, 0, 0, 0, 557, 558, 5, 80, 0, 0, 558, 559, 5, 61, 0, 0, 559, 560, 3, 32, 16, 0, 560, 561, 5, 81, 0, 0, 561, 562, 5, 62, 0, 0, 562, 570, 1, 0, 0, 0, 563, 564, 5, 80, 0, 0, 564, 565, 5, 63, 0, 0, 565, 566, 3, 32, 16, 0, 566, 567, 5, 81, 0, 0, 567, 568, 5, 64, 0, 0, 568, 570, 1, 0, 0, 0, 569, 457, 1, 0, 0, 0, 569, 461, 1, 0, 0, 0, 569, 465, 1, 0, 0, 0, 569, 469, 1, 0, 0, 0, 569, 473, 1, 0, 0, 0, 569, 477, 1, 0, 0, 0, 569, 481, 1, 0, 0, 0, 569, 485, 1, 0, 0, 0, 569, 491, 1, 0, 0, 0, 569, 497, 1, 0, 0, 0, 569, 503, 1, 0, 0, 0, 569, 509, 1, 0, 0, 0, 569, 515, 1, 0, 0, 0, 569, 521, 1, 0, 0, 0, 569, 527, 1, 0, 0, 0, 569, 533, 1, 0, 0, 0, 569, 539, 1, 0, 0, 0, 569, 545, 1, 0, 0, 0, 569, 551, 1, 0, 0, 0, 569, 557, 1, 0, 0, 0, 569, 563, 1, 0, 0, 0, 570, 65, 1, 0, 0, 0, 571, 572, 5, 69, 0, 0, 572, 573, 3, 32, 16, 0, 573, 574, 5, 69, 0, 0, 574, 588, 1, 0, 0, 0, 575, 576, 5, 78, 0, 0, 576, 577, 5, 69, 0, 0, 577, 578, 3, 32, 16, 0, 578, 579, 5, 79, 0, 0, 579, 580, 5, 69, 0, 0, 580, 588, 1, 0, 0, 0, 581, 582, 5, 80, 0, 0, 582, 583, 5, 69, 0, 0, 583, 584, 3, 32, 16, 0, 584, 585, 5, 81, 0, 0, 585, 586, 5, 69, 0, 0, 586, 588, 1, 0, 0, 0, 587, 571, 1, 0, 0, 0, 587, 575, 1, 0, 0, 0, 587, 581, 1, 0, 0, 0, 588, 67, 1, 0, 0, 0, 589, 590, 5, 65, 0, 0, 590, 591, 3, 32, 16, 0, 591, 592, 5, 65, 0, 0, 592, 638, 1, 0, 0, 0, 593, 594, 5, 66, 0, 0, 594, 595, 3, 32, 16, 0, 595, 596, 5, 67, 0, 0, 596, 638, 1, 0, 0, 0, 597, 598, 5, 68, 0, 0, 598, 599, 3, 32, 16, 0, 599, 600, 5, 68, 0, 0, 600, 638, 1, 0, 0, 0, 601, 602, 5, 78, 0, 0, 602, 603, 5, 65, 0, 0, 603, 604, 3, 32, 16, 0, 604, 605, 5, 79, 0, 0, 605, 606, 5, 65, 0, 0, 606, 638, 1, 0, 0, 0, 607, 608, 5, 78, 0, 0, 608, 609, 5, 66, 0, 0, 609, 610, 3, 32, 16, 0, 610, 611, 5, 79, 0, 0, 611, 612, 5, 67, 0, 0, 612, 638, 1, 0, 0, 0, 613, 614, 5, 78, 0, 0, 614, 615, 5, 68, 0, 0, 615, 616, 3, 32, 16, 0, 616, 617, 5, 79, 0, 0, 617, 618, 5, 68, 0, 0, 618, 638, 1, 0, 0, 0, 619, 620, 5, 80, 0, 0, 620, 621, 5, 65, 0, 0, 621, 622, 3, 32, 16, 0, 622, 623, 5, 81, 0, 0, 623, 624, 5, 65, 0, 0, 624, 638, 1, 0, 0, 0, 625, 626, 5, 80, 0, 0, 626, 627, 5, 66, 0, 0, 627, 628, 3, 32, 16, 0, 628, 629, 5, 81, 0, 0, 629, 630, 5, 67, 0, 0, 630, 638, 1, 0, 0, 0, 631, 632, 5, 80, 0, 0, 632, 633, 5, 68, 0, 0, 633, 634, 3, 32, 16, 0, 634, 635, 5, 81, 0, 0, 635, 636, 5, 68, 0, 0, 636, 638, 1, 0, 0, 0, 637, 589, 1, 0, 0, 0, 637, 593, 1, 0, 0, 0, 637, 597, 1, 0, 0, 0, 637, 601, 1, 0, 0, 0, 637, 607, 1, 0, 0, 0, 637, 613, 1, 0, 0, 0, 637, 619, 1, 0, 0, 0, 637, 625, 1, 0, 0, 0, 637, 631, 1, 0, 0, 0, 638, 69, 1, 0, 0, 0, 639, 640, 5, 70, 0, 0, 640, 641, 3, 32, 16, 0, 641, 642, 5, 71, 0, 0, 642, 672, 1, 0, 0, 0, 643, 644, 5, 72, 0, 0, 644, 645, 3, 32, 16, 0, 645, 646, 5, 73, 0, 0, 646, 672, 1, 0, 0, 0, 647, 648, 5, 78, 0, 0, 648, 649, 5, 70, 0, 0, 649, 650, 3, 32, 16, 0, 650, 651, 5, 79, 0, 0, 651, 652, 5, 71, 0, 0, 652, 672, 1, 0, 0, 0, 653, 654, 5, 78, 0, 0, 654, 655, 5, 72, 0, 0, 655, 656, 3, 32, 16, 0, 656, 657, 5, 79, 0, 0, 657, 658, 5, 73, 0, 0, 658, 672, 1, 0, 0, 0, 659, 660, 5, 80, 0, 0, 660, 661, 5, 70, 0, 0, 661, 662, 3, 32, 16, 0, 662, 663, 5, 81, 0, 0, 663, 664, 5, 71, 0, 0, 664, 672, 1, 0, 0, 0, 665, 666, 5, 80, 0, 0, 666, 667, 5, 72, 0, 0, 667, 668, 3, 32, 16, 0, 668, 669, 5, 81, 0, 0, 669, 670, 5, 73, 0, 0, 670, 672, 1, 0, 0, 0, 671, 639, 1, 0, 0, 0, 671, 643, 1, 0, 0, 0, 671, 647, 1, 0, 0, 0, 671, 653, 1, 0, 0, 0, 671, 659, 1, 0, 0, 0, 671, 665, 1, 0, 0, 0, 672, 71, 1, 0, 0, 0, 673, 674, 5, 74, 0, 0, 674, 675, 3, 32, 16, 0, 675, 676, 5, 75, 0, 0, 676, 706, 1, 0, 0, 0, 677, 678, 5, 76, 0, 0, 678, 679, 3, 32, 16, 0, 679, 680, 5, 77, 0, 0, 680, 706, 1, 0, 0, 0, 681, 682, 5, 78, 0, 0, 682, 683, 5, 74, 0, 0, 683, 684, 3, 32, 16, 0, 684, 685, 5, 79, 0, 0, 685, 686, 5, 75, 0, 0, 686, 706, 1, 0, 0, 0, 687, 688, 5, 78, 0, 0, 688, 689, 5, 76, 0, 0, 689, 690, 3, 32, 16, 0, 690, 691, 5, 79, 0, 0, 691, 692, 5, 77, 0, 0, 692, 706, 1, 0, 0, 0, 693, 694, 5, 80, 0, 0, 694, 695, 5, 74, 0, 0, 695, 696, 3, 32, 16, 0, 696, 697, 5, 81, 0, 0, 697, 698, 5, 75, 0, 0, 698, 706, 1, 0, 0, 0, 699, 700, 5, 80, 0, 0, 700, 701, 5, 76, 0, 0, 701, 702, 3, 32, 16, 0, 702, 703, 5, 81, 0, 0, 703, 704, 5, 77, 0, 0, 704, 706, 1, 0, 0, 0, 705, 673, 1, 0, 0, 0, 705, 677, 1, 0, 0, 0, 705, 681, 1, 0, 0, 0, 705, 687, 1, 0, 0, 0, 705, 693, 1, 0, 0, 0, 705, 699, 1, 0, 0, 0, 706, 73, 1, 0, 0, 0, 707, 708, 3, 0, 0, 0, 708, 709, 5, 55, 0, 0, 709, 710, 3, 32, 16, 0, 710, 711, 5, 56, 0, 0, 711, 75, 1, 0, 0, 0, 712, 717, 5, 176, 0, 0, 713, 717, 5, 191, 0, 0, 714, 717, 5, 192, 0, 0, 715, 717, 3, 74, 37, 0, 716, 712, 1, 0, 0, 0, 716, 713, 1, 0, 0, 0, 716, 714, 1, 0, 0, 0, 716, 715, 1, 0, 0, 0, 717, 719, 1, 0, 0, 0, 718, 720, 3, 118, 59, 0, 719, 718, 1, 0, 0, 0, 719, 720, 1, 0, 0, 0, 720, 77, 1, 0, 0, 0, 721, 726, 5, 176, 0, 0, 722, 726, 5, 191, 0, 0, 723, 726, 5, 192, 0, 0, 724, 726, 3, 74, 37, 0, 725, 721, 1, 0, 0, 0, 725, 722, 1, 0, 0, 0, 725, 723, 1, 0, 0, 0, 725, 724, 1, 0, 0, 0, 726, 735, 1, 0, 0, 0, 727, 728, 3, 120, 60, 0, 728, 729, 3, 118, 59, 0, 729, 736, 1, 0, 0, 0, 730, 731, 3, 118, 59, 0, 731, 732, 3, 120, 60, 0, 732, 736, 1, 0, 0, 0, 733, 736, 3, 118, 59, 0, 734, 736, 3, 120, 60, 0, 735, 727, 1, 0, 0, 0, 735, 730, 1, 0, 0, 0, 735, 733, 1, 0, 0, 0, 735, 734, 1, 0, 0, 0, 735, 736, 1, 0, 0, 0, 736, 79, 1, 0, 0, 0, 737, 746, 3, 78, 39, 0, 738, 746, 5, 193, 0, 0, 739, 746, 5, 179, 0, 0, 740, 746, 5, 190, 0, 0, 741, 746, 5, 180, 0, 0, 742, 746, 5, 173, 0, 0, 743, 746, 3, 82, 41, 0, 744, 746, 5, 194, 0, 0, 745, 737, 1, 0, 0, 0, 745, 738, 1, 0, 0, 0, 745, 739, 1, 0, 0, 0, 745, 740, 1, 0, 0, 0, 745, 741, 1, 0, 0, 0, 745, 742, 1, 0, 0, 0, 745, 743, 1, 0, 0, 0, 745, 744, 1, 0, 0, 0, 746, 81, 1, 0, 0, 0, 747, 748, 5, 154, 0, 0, 748, 749, 5, 55, 0, 0, 749, 750, 3, 84, 42, 0, 750, 751, 5, 56, 0, 0, 751, 83, 1, 0, 0, 0, 752, 754, 7, 6, 0, 0, 753, 752, 1, 0, 0, 0, 754, 755, 1, 0, 0, 0, 755, 753, 1, 0, 0, 0, 755, 756, 1, 0, 0, 0, 756, 85, 1, 0, 0, 0, 757, 758, 5, 150, 0, 0, 758, 759, 5, 55, 0, 0, 759, 760, 3, 32, 16, 0, 760, 761, 5, 56, 0, 0, 761, 762, 5, 55, 0, 0, 762, 763, 3, 32, 16, 0, 763, 764, 5, 56, 0, 0, 764, 87, 1, 0, 0, 0, 765, 766, 5, 55, 0, 0, 766, 767, 3, 32, 16, 0, 767, 768, 5, 152, 0, 0, 768, 769, 3, 32, 16, 0, 769, 770, 5, 56, 0, 0, 770, 780, 1, 0, 0, 0, 771, 772, 5, 151, 0, 0, 772, 773, 5, 55, 0, 0, 773, 774, 3, 32, 16, 0, 774, 775, 5, 56, 0, 0, 775, 776, 5, 55, 0, 0, 776, 777, 3, 32, 16, 0, 777, 778, 5, 56, 0, 0, 778, 780, 1, 0, 0, 0, 779, 765, 1, 0, 0, 0, 779, 771, 1, 0, 0, 0, 780, 89, 1, 0, 0, 0, 781, 782, 7, 7, 0, 0, 782, 91, 1, 0, 0, 0, 783, 784, 7, 8, 0, 0, 784, 93, 1, 0, 0, 0, 785, 786, 7, 9, 0, 0, 786, 95, 1, 0, 0, 0, 787, 788, 7, 10, 0, 0, 788, 97, 1, 0, 0, 0, 789, 796, 3, 90, 45, 0, 790, 791, 5, 155, 0, 0, 791, 792, 5, 55, 0, 0, 792, 793, 3, 94, 47, 0, 793, 794, 5, 56, 0, 0, 794, 796, 1, 0, 0, 0, 795, 789, 1, 0, 0, 0, 795, 790, 1, 0, 0, 0, 796, 99, 1, 0, 0, 0, 797, 804, 3, 92, 46, 0, 798, 799, 5, 155, 0, 0, 799, 800, 5, 55, 0, 0, 800, 801, 3, 96, 48, 0, 801, 802, 5, 56, 0, 0, 802, 804, 1, 0, 0, 0, 803, 797, 1, 0, 0, 0, 803, 798, 1, 0, 0, 0, 804, 101, 1, 0, 0, 0, 805, 818, 3, 98, 49, 0, 806, 808, 3, 118, 59, 0, 807, 806, 1, 0, 0, 0, 807, 808, 1, 0, 0, 0, 808, 810, 1, 0, 0, 0, 809, 811, 3, 120, 60, 0, 810, 809, 1, 0, 0, 0, 810, 811, 1, 0, 0, 0, 811, 819, 1, 0, 0, 0, 812, 814, 3, 120, 60, 0, 813, 812, 1, 0, 0, 0, 813, 814, 1, 0, 0, 0, 814, 816, 1, 0, 0, 0, 815, 817, 3, 118, 59, 0, 816, 815, 1, 0, 0, 0, 816, 817, 1, 0, 0, 0, 817, 819, 1, 0, 0, 0, 818, 807, 1, 0, 0, 0, 818, 813, 1, 0, 0, 0, 819, 841, 1, 0, 0, 0, 820, 822, 5, 78, 0, 0, 821, 820, 1, 0, 0, 0, 821, 822, 1, 0, 0, 0, 822, 823, 1, 0, 0, 0, 823, 824, 5, 51, 0, 0, 824, 826, 3, 110, 55, 0, 825, 827, 5, 79, 0, 0, 826, 825, 1, 0, 0, 0, 826, 827, 1, 0, 0, 0, 827, 828, 1, 0, 0, 0, 828, 829, 5, 52, 0, 0, 829, 842, 1, 0, 0, 0, 830, 832, 5, 80, 0, 0, 831, 830, 1, 0, 0, 0, 831, 832, 1, 0, 0, 0, 832, 833, 1, 0, 0, 0, 833, 834, 5, 51, 0, 0, 834, 836, 3, 110, 55, 0, 835, 837, 5, 81, 0, 0, 836, 835, 1, 0, 0, 0, 836, 837, 1, 0, 0, 0, 837, 838, 1, 0, 0, 0, 838, 839, 5, 52, 0, 0, 839, 842, 1, 0, 0, 0, 840, 842, 3, 112, 56, 0, 841, 821, 1, 0, 0, 0, 841, 831, 1, 0, 0, 0, 841, 840, 1, 0, 0, 0, 842, 972, 1, 0, 0, 0, 843, 856, 3, 100, 50, 0, 844, 846, 3, 118, 59, 0, 845, 844, 1, 0, 0, 0, 845, 846, 1, 0, 0, 0, 846, 848, 1, 0, 0, 0, 847, 849, 3, 120, 60, 0, 848, 847, 1, 0, 0, 0, 848, 849, 1, 0, 0, 0, 849, 857, 1, 0, 0, 0, 850, 852, 3, 120, 60, 0, 851, 850, 1, 0, 0, 0, 851, 852, 1, 0, 0, 0, 852, 854, 1, 0, 0, 0, 853, 855, 3, 118, 59, 0, 854, 853, 1, 0, 0, 0, 854, 855, 1, 0, 0, 0, 855, 857, 1, 0, 0, 0, 856, 845, 1, 0, 0, 0, 856, 851, 1, 0, 0, 0, 857, 879, 1, 0, 0, 0, 858, 860, 5, 78, 0, 0, 859, 858, 1, 0, 0, 0, 859, 860, 1, 0, 0, 0, 860, 861, 1, 0, 0, 0, 861, 862, 5, 51, 0, 0, 862, 864, 3, 114, 57, 0, 863, 865, 5, 79, 0, 0, 864, 863, 1, 0, 0, 0, 864, 865, 1, 0, 0, 0, 865, 866, 1, 0, 0, 0, 866, 867, 5, 52, 0, 0, 867, 880, 1, 0, 0, 0, 868, 870, 5, 80, 0, 0, 869, 868, 1, 0, 0, 0, 869, 870, 1, 0, 0, 0, 870, 871, 1, 0, 0, 0, 871, 872, 5, 51, 0, 0, 872, 874, 3, 114, 57, 0, 873, 875, 5, 81, 0, 0, 874, 873, 1, 0, 0, 0, 874, 875, 1, 0, 0, 0, 875, 876, 1, 0, 0, 0, 876, 877, 5, 52, 0, 0, 877, 880, 1, 0, 0, 0, 878, 880, 3, 116, 58, 0, 879, 859, 1, 0, 0, 0, 879, 869, 1, 0, 0, 0, 879, 878, 1, 0, 0, 0, 880, 972, 1, 0, 0, 0, 881, 883, 3, 76, 38, 0, 882, 884, 3, 120, 60, 0, 883, 882, 1, 0, 0, 0, 883, 884, 1, 0, 0, 0, 884, 886, 1, 0, 0, 0, 885, 887, 5, 78, 0, 0, 886, 885, 1, 0, 0, 0, 886, 887, 1, 0, 0, 0, 887, 888, 1, 0, 0, 0, 888, 889, 7, 11, 0, 0, 889, 890, 3, 106, 53, 0, 890, 892, 7, 12, 0, 0, 891, 893, 5, 79, 0, 0, 892, 891, 1, 0, 0, 0, 892, 893, 1, 0, 0, 0, 893, 972, 1, 0, 0, 0, 894, 896, 3, 76, 38, 0, 895, 897, 3, 120, 60, 0, 896, 895, 1, 0, 0, 0, 896, 897, 1, 0, 0, 0, 897, 898, 1, 0, 0, 0, 898, 900, 5, 55, 0, 0, 899, 901, 5, 78, 0, 0, 900, 899, 1, 0, 0, 0, 900, 901, 1, 0, 0, 0, 901, 902, 1, 0, 0, 0, 902, 903, 7, 11, 0, 0, 903, 904, 3, 106, 53, 0, 904, 906, 7, 12, 0, 0, 905, 907, 5, 79, 0, 0, 906, 905, 1, 0, 0, 0, 906, 907, 1, 0, 0, 0, 907, 908, 1, 0, 0, 0, 908, 909, 5, 56, 0, 0, 909, 972, 1, 0, 0, 0, 910, 931, 5, 84, 0, 0, 911, 912, 3, 118, 59, 0, 912, 913, 3, 120, 60, 0, 913, 932, 1, 0, 0, 0, 914, 915, 3, 120, 60, 0, 915, 916, 3, 118, 59, 0, 916, 932, 1, 0, 0, 0, 917, 918, 5, 167, 0, 0, 918, 919, 5, 55, 0, 0, 919, 920, 5, 56, 0, 0, 920, 921, 1, 0, 0, 0, 921, 922, 5, 168, 0, 0, 922, 923, 5, 55, 0, 0, 923, 932, 5, 56, 0, 0, 924, 925, 5, 168, 0, 0, 925, 926, 5, 55, 0, 0, 926, 927, 5, 56, 0, 0, 927, 928, 1, 0, 0, 0, 928, 929, 5, 167, 0, 0, 929, 930, 5, 55, 0, 0, 930, 932, 5, 56, 0, 0, 931, 911, 1, 0, 0, 0, 931, 914, 1, 0, 0, 0, 931, 917, 1, 0, 0, 0, 931, 924, 1, 0, 0, 0, 931, 932, 1, 0, 0, 0, 932, 939, 1, 0, 0, 0, 933, 935, 3, 34, 17, 0, 934, 933, 1, 0, 0, 0, 934, 935, 1, 0, 0, 0, 935, 936, 1, 0, 0, 0, 936, 940, 5, 173, 0, 0, 937, 940, 3, 86, 43, 0, 938, 940, 3, 34, 17, 0, 939, 934, 1, 0, 0, 0, 939, 937, 1, 0, 0, 0, 939, 938, 1, 0, 0, 0, 940, 972, 1, 0, 0, 0, 941, 946, 5, 121, 0, 0, 942, 943, 5, 61, 0, 0, 943, 944, 3, 32, 16, 0, 944, 945, 5, 62, 0, 0, 945, 947, 1, 0, 0, 0, 946, 942, 1, 0, 0, 0, 946, 947, 1, 0, 0, 0, 947, 948, 1, 0, 0, 0, 948, 949, 5, 55, 0, 0, 949, 950, 3, 32, 16, 0, 950, 951, 5, 56, 0, 0, 951, 972, 1, 0, 0, 0, 952, 959, 7, 13, 0, 0, 953, 954, 3, 122, 61, 0, 954, 955, 3, 120, 60, 0, 955, 960, 1, 0, 0, 0, 956, 957, 3, 120, 60, 0, 957, 958, 3, 122, 61, 0, 958, 960, 1, 0, 0, 0, 959, 953, 1, 0, 0, 0, 959, 956, 1, 0, 0, 0, 960, 961, 1, 0, 0, 0, 961, 962, 3, 36, 18, 0, 962, 972, 1, 0, 0, 0, 963, 964, 5, 82, 0, 0, 964, 965, 3, 108, 54, 0, 965, 966, 3, 36, 18, 0, 966, 972, 1, 0, 0, 0, 967, 969, 5, 174, 0, 0, 968, 970, 3, 120, 60, 0, 969, 968, 1, 0, 0, 0, 969, 970, 1, 0, 0, 0, 970, 972, 1, 0, 0, 0, 971, 805, 1, 0, 0, 0, 971, 843, 1, 0, 0, 0, 971, 881, 1, 0, 0, 0, 971, 894, 1, 0, 0, 0, 971, 910, 1, 0, 0, 0, 971, 941, 1, 0, 0, 0, 971, 952, 1, 0, 0, 0, 971, 963, 1, 0, 0, 0, 971, 967, 1, 0, 0, 0, 972, 103, 1, 0, 0, 0, 973, 974, 3, 32, 16, 0, 974, 975, 5, 171, 0, 0, 975, 976, 3, 104, 52, 0, 976, 979, 1, 0, 0, 0, 977, 979, 3, 32, 16, 0, 978, 973, 1, 0, 0, 0, 978, 977, 1, 0, 0, 0, 979, 105, 1, 0, 0, 0, 980, 989, 3, 80, 40, 0, 981, 982, 3, 32, 16, 0, 982, 983, 5, 171, 0, 0, 983, 989, 1, 0, 0, 0, 984, 985, 3, 32, 16, 0, 985, 986, 5, 171, 0, 0, 986, 987, 3, 104, 52, 0, 987, 989, 1, 0, 0, 0, 988, 980, 1, 0, 0, 0, 988, 981, 1, 0, 0, 0, 988, 984, 1, 0, 0, 0, 989, 107, 1, 0, 0, 0, 990, 991, 5, 167, 0, 0, 991, 992, 5, 55, 0, 0, 992, 993, 7, 14, 0, 0, 993, 994, 5, 83, 0, 0, 994, 999, 3, 32, 16, 0, 995, 996, 5, 168, 0, 0, 996, 997, 5, 55, 0, 0, 997, 998, 7, 4, 0, 0, 998, 1000, 5, 56, 0, 0, 999, 995, 1, 0, 0, 0, 999, 1000, 1, 0, 0, 0, 1000, 1001, 1, 0, 0, 0, 1001, 1002, 5, 56, 0, 0, 1002, 109, 1, 0, 0, 0, 1003, 1004, 3, 32, 16, 0, 1004, 111, 1, 0, 0, 0, 1005, 1006, 3, 38, 19, 0, 1006, 113, 1, 0, 0, 0, 1007, 1013, 3, 32, 16, 0, 1008, 1009, 3, 32, 16, 0, 1009, 1010, 5, 171, 0, 0, 1010, 1011, 3, 114, 57, 0, 1011, 1013, 1, 0, 0, 0, 1012, 1007, 1, 0, 0, 0, 1012, 1008, 1, 0, 0, 0, 1013, 115, 1, 0, 0, 0, 1014, 1015, 3, 38, 19, 0, 1015, 117, 1, 0, 0, 0, 1016, 1025, 5, 167, 0, 0, 1017, 1026, 3, 80, 40, 0, 1018, 1021, 5, 55, 0, 0, 1019, 1022, 3, 32, 16, 0, 1020, 1022, 3, 104, 52, 0, 1021, 1019, 1, 0, 0, 0, 1021, 1020, 1, 0, 0, 0, 1022, 1023, 1, 0, 0, 0, 1023, 1024, 5, 56, 0, 0, 1024, 1026, 1, 0, 0, 0, 1025, 1017, 1, 0, 0, 0, 1025, 1018, 1, 0, 0, 0, 1026, 119, 1, 0, 0, 0, 1027, 1033, 5, 168, 0, 0, 1028, 1034, 3, 80, 40, 0, 1029, 1030, 5, 55, 0, 0, 1030, 1031, 3, 32, 16, 0, 1031, 1032, 5, 56, 0, 0, 1032, 1034, 1, 0, 0, 0, 1033, 1028, 1, 0, 0, 0, 1033, 1029, 1, 0, 0, 0, 1034, 121, 1, 0, 0, 0, 1035, 1036, 5, 167, 0, 0, 1036, 1037, 5, 55, 0, 0, 1037, 1038, 3, 30, 15, 0, 1038, 1039, 5, 56, 0, 0, 1039, 123, 1, 0, 0, 0, 1040, 1041, 5, 167, 0, 0, 1041, 1042, 5, 55, 0, 0, 1042, 1043, 3, 30, 15, 0, 1043, 1044, 5, 56, 0, 0, 1044, 125, 1, 0, 0, 0, 92, 130, 140, 146, 160, 167, 176, 180, 188, 194, 202, 206, 215, 226, 266, 275, 285, 288, 304, 315, 326, 334, 336, 344, 347, 353, 360, 366, 374, 380, 388, 402, 405, 409, 422, 425, 429, 443, 455, 569, 587, 637, 671, 705, 716, 719, 725, 735, 745, 755, 779, 795, 803, 807, 810, 813, 816, 818, 821, 826, 831, 836, 841, 845, 848, 851, 854, 856, 859, 864, 869, 874, 879, 883, 886, 892, 896, 900, 906, 931, 934, 939, 946, 959, 969, 971, 978, 988, 999, 1012, 1021, 1025, 1033]

latex2sympy/gen/PS.tokens

@@ -0,0 +1,357 @@
+T__0=1
+T__1=2
+T__2=3
+T__3=4
+T__4=5
+T__5=6
+T__6=7
+T__7=8
+T__8=9
+T__9=10
+T__10=11
+T__11=12
+T__12=13
+T__13=14
+T__14=15
+T__15=16
+T__16=17
+T__17=18
+T__18=19
+T__19=20
+T__20=21
+T__21=22
+T__22=23
+T__23=24
+T__24=25
+T__25=26
+T__26=27
+T__27=28
+T__28=29
+T__29=30
+T__30=31
+T__31=32
+T__32=33
+T__33=34
+T__34=35
+T__35=36
+T__36=37
+T__37=38
+T__38=39
+T__39=40
+T__40=41
+T__41=42
+T__42=43
+T__43=44
+WS=45
+DOLLAR_SIGN=46
+ADD=47
+SUB=48
+MUL=49
+DIV=50
+L_PAREN=51
+R_PAREN=52
+L_GROUP=53
+R_GROUP=54
+L_BRACE=55
+R_BRACE=56
+L_BRACE_VISUAL=57
+R_BRACE_VISUAL=58
+L_BRACE_CMD=59
+R_BRACE_CMD=60
+L_BRACKET=61
+R_BRACKET=62
+L_BRACK=63
+R_BRACK=64
+BAR=65
+L_VERT=66
+R_VERT=67
+VERT=68
+NORM=69
+L_FLOOR=70
+R_FLOOR=71
+LL_CORNER=72
+LR_CORNER=73
+L_CEIL=74
+R_CEIL=75
+UL_CORNER=76
+UR_CORNER=77
+L_LEFT=78
+R_RIGHT=79
+ML_LEFT=80
+MR_RIGHT=81
+FUNC_LIM=82
+LIM_APPROACH_SYM=83
+FUNC_INT=84
+FUNC_SUM=85
+FUNC_PROD=86
+FUNC_LOG=87
+FUNC_LN=88
+FUNC_EXP=89
+FUNC_SIN=90
+FUNC_COS=91
+FUNC_TAN=92
+FUNC_CSC=93
+FUNC_SEC=94
+FUNC_COT=95
+FUNC_ARCSIN=96
+FUNC_ARCCOS=97
+FUNC_ARCTAN=98
+FUNC_ARCCSC=99
+FUNC_ARCSEC=100
+FUNC_ARCCOT=101
+FUNC_SINH=102
+FUNC_COSH=103
+FUNC_TANH=104
+FUNC_ARSINH=105
+FUNC_ARCOSH=106
+FUNC_ARTANH=107
+FUNC_ARCSINH=108
+FUNC_ARCCOSH=109
+FUNC_ARCTANH=110
+FUNC_ARSINH_NAME=111
+FUNC_ARCSINH_NAME=112
+FUNC_ARCOSH_NAME=113
+FUNC_ARCCOSH_NAME=114
+FUNC_ARTANH_NAME=115
+FUNC_ARCTANH_NAME=116
+FUNC_GCD_NAME=117
+FUNC_LCM_NAME=118
+FUNC_FLOOR_NAME=119
+FUNC_CEIL_NAME=120
+FUNC_SQRT=121
+FUNC_GCD=122
+FUNC_LCM=123
+FUNC_FLOOR=124
+FUNC_CEIL=125
+FUNC_MAX=126
+FUNC_MIN=127
+FUNC_DET=128
+FUNC_EYE_NAME=129
+FUNC_ZEROS_NAME=130
+FUNC_ONES_NAME=131
+FUNC_COLS_NAME=132
+FUNC_ROWS_NAME=133
+FUNC_DIAG_NAME=134
+FUNC_NORM_NAME=135
+FUNC_RANK_NAME=136
+FUNC_TRACE_NAME=137
+FUNC_RREF_NAME=138
+FUNC_HSTACK_NAME=139
+FUNC_VSTACK_NAME=140
+FUNC_ORTHOGONALIZE_NAME=141
+FUNC_NULLSPACE_NAME=142
+FUNC_DIAGONALIZE_NAME=143
+FUNC_EIGENVALS_NAME=144
+FUNC_EIGENVECTORS_NAME=145
+FUNC_SVD_NAME=146
+CMD_TIMES=147
+CMD_CDOT=148
+CMD_DIV=149
+CMD_FRAC=150
+CMD_BINOM=151
+CMD_CHOOSE=152
+CMD_MOD=153
+CMD_MATHIT=154
+CMD_OPERATORNAME=155
+MATRIX_TYPE_MATRIX=156
+MATRIX_TYPE_PMATRIX=157
+MATRIX_TYPE_BMATRIX=158
+MATRIX_TYPE_DET=159
+MATRIX_TYPES=160
+CMD_MATRIX_START=161
+CMD_MATRIX_END=162
+CMD_DET_START=163
+CMD_DET_END=164
+MATRIX_DEL_COL=165
+MATRIX_DEL_ROW=166
+UNDERSCORE=167
+CARET=168
+COLON=169
+SEMICOLON=170
+COMMA=171
+PERIOD=172
+DIFFERENTIAL=173
+EXP_E=174
+E_NOTATION_E=175
+LETTER_NO_E=176
+MATRIX_XRIGHTARROW=177
+TRANSFORM_EXCHANGE=178
+NUMBER=179
+E_NOTATION=180
+IN=181
+ASSIGNMENT=182
+EQUAL=183
+LT=184
+LTE=185
+GT=186
+GTE=187
+UNEQUAL=188
+BANG=189
+PERCENT_NUMBER=190
+GREEK_CMD=191
+OTHER_SYMBOL_CMD=192
+SYMBOL=193
+VARIABLE=194
+'\\acute'=1
+'\\bar'=2
+'\\overline'=3
+'\\breve'=4
+'\\check'=5
+'\\widecheck'=6
+'\\dot'=7
+'\\ddot'=8
+'\\grave'=9
+'\\hat'=10
+'\\tilde'=11
+'\\widetilde'=12
+'\\vec'=13
+'\\overrightarrow'=14
+'\\bm'=15
+'\\boldsymbol'=16
+'\\text'=17
+'\\textit'=18
+'\\mathbb'=19
+'\\mathbin'=20
+'\\mathbf'=21
+'\\mathcal'=22
+'\\mathclap'=23
+'\\mathclose'=24
+'\\mathellipsis'=25
+'\\mathfrak'=26
+'\\mathinner'=27
+'\\mathnormal'=28
+'\\mathop'=29
+'\\mathopen'=30
+'\\mathord'=31
+'\\mathpunct'=32
+'\\mathrel'=33
+'\\mathring'=34
+'\\mathrlap'=35
+'\\mathrm'=36
+'\\mathscr'=37
+'\\mathsf'=38
+'\\mathsterling'=39
+'\\mathtt'=40
+'^T'=41
+'^{T}'=42
+'^{\\top}'=43
+'\''=44
+'\\$'=46
+'+'=47
+'-'=48
+'*'=49
+'('=51
+')'=52
+'\\lgroup'=53
+'\\rgroup'=54
+'{'=55
+'}'=56
+'\\{'=57
+'\\}'=58
+'\\lbrace'=59
+'\\rbrace'=60
+'['=61
+']'=62
+'\\lbrack'=63
+'\\rbrack'=64
+'|'=65
+'\\lvert'=66
+'\\rvert'=67
+'\\vert'=68
+'\\|'=69
+'\\lfloor'=70
+'\\rfloor'=71
+'\\llcorner'=72
+'\\lrcorner'=73
+'\\lceil'=74
+'\\rceil'=75
+'\\ulcorner'=76
+'\\urcorner'=77
+'\\left'=78
+'\\right'=79
+'\\mleft'=80
+'\\mright'=81
+'\\lim'=82
+'\\int'=84
+'\\sum'=85
+'\\prod'=86
+'\\log'=87
+'\\ln'=88
+'\\exp'=89
+'\\sin'=90
+'\\cos'=91
+'\\tan'=92
+'\\csc'=93
+'\\sec'=94
+'\\cot'=95
+'\\arcsin'=96
+'\\arccos'=97
+'\\arctan'=98
+'\\arccsc'=99
+'\\arcsec'=100
+'\\arccot'=101
+'\\sinh'=102
+'\\cosh'=103
+'\\tanh'=104
+'\\arsinh'=105
+'\\arcosh'=106
+'\\artanh'=107
+'\\arcsinh'=108
+'\\arccosh'=109
+'\\arctanh'=110
+'arsinh'=111
+'arcsinh'=112
+'arcosh'=113
+'arccosh'=114
+'artanh'=115
+'arctanh'=116
+'gcd'=117
+'lcm'=118
+'floor'=119
+'ceil'=120
+'\\sqrt'=121
+'\\gcd'=122
+'\\lcm'=123
+'\\floor'=124
+'\\ceil'=125
+'\\max'=126
+'\\min'=127
+'\\det'=128
+'eye'=129
+'zeros'=130
+'ones'=131
+'cols'=132
+'rows'=133
+'diag'=134
+'norm'=135
+'rank'=136
+'rref'=138
+'hstack'=139
+'vstack'=140
+'nullspace'=142
+'\\times'=147
+'\\cdot'=148
+'\\div'=149
+'\\frac'=150
+'\\choose'=152
+'\\mod'=153
+'\\mathit'=154
+'\\operatorname'=155
+'matrix'=156
+'pmatrix'=157
+'bmatrix'=158
+'vmatrix'=159
+'&'=165
+'\\\\'=166
+'_'=167
+'^'=168
+':'=169
+';'=170
+','=171
+'.'=172
+'E'=175
+'\\in'=181
+'='=182
+'<'=184
+'>'=186
+'!'=189

latex2sympy/gen/PSLexer.tokens

@@ -0,0 +1,357 @@
+T__0=1
+T__1=2
+T__2=3
+T__3=4
+T__4=5
+T__5=6
+T__6=7
+T__7=8
+T__8=9
+T__9=10
+T__10=11
+T__11=12
+T__12=13
+T__13=14
+T__14=15
+T__15=16
+T__16=17
+T__17=18
+T__18=19
+T__19=20
+T__20=21
+T__21=22
+T__22=23
+T__23=24
+T__24=25
+T__25=26
+T__26=27
+T__27=28
+T__28=29
+T__29=30
+T__30=31
+T__31=32
+T__32=33
+T__33=34
+T__34=35
+T__35=36
+T__36=37
+T__37=38
+T__38=39
+T__39=40
+T__40=41
+T__41=42
+T__42=43
+T__43=44
+WS=45
+DOLLAR_SIGN=46
+ADD=47
+SUB=48
+MUL=49
+DIV=50
+L_PAREN=51
+R_PAREN=52
+L_GROUP=53
+R_GROUP=54
+L_BRACE=55
+R_BRACE=56
+L_BRACE_VISUAL=57
+R_BRACE_VISUAL=58
+L_BRACE_CMD=59
+R_BRACE_CMD=60
+L_BRACKET=61
+R_BRACKET=62
+L_BRACK=63
+R_BRACK=64
+BAR=65
+L_VERT=66
+R_VERT=67
+VERT=68
+NORM=69
+L_FLOOR=70
+R_FLOOR=71
+LL_CORNER=72
+LR_CORNER=73
+L_CEIL=74
+R_CEIL=75
+UL_CORNER=76
+UR_CORNER=77
+L_LEFT=78
+R_RIGHT=79
+ML_LEFT=80
+MR_RIGHT=81
+FUNC_LIM=82
+LIM_APPROACH_SYM=83
+FUNC_INT=84
+FUNC_SUM=85
+FUNC_PROD=86
+FUNC_LOG=87
+FUNC_LN=88
+FUNC_EXP=89
+FUNC_SIN=90
+FUNC_COS=91
+FUNC_TAN=92
+FUNC_CSC=93
+FUNC_SEC=94
+FUNC_COT=95
+FUNC_ARCSIN=96
+FUNC_ARCCOS=97
+FUNC_ARCTAN=98
+FUNC_ARCCSC=99
+FUNC_ARCSEC=100
+FUNC_ARCCOT=101
+FUNC_SINH=102
+FUNC_COSH=103
+FUNC_TANH=104
+FUNC_ARSINH=105
+FUNC_ARCOSH=106
+FUNC_ARTANH=107
+FUNC_ARCSINH=108
+FUNC_ARCCOSH=109
+FUNC_ARCTANH=110
+FUNC_ARSINH_NAME=111
+FUNC_ARCSINH_NAME=112
+FUNC_ARCOSH_NAME=113
+FUNC_ARCCOSH_NAME=114
+FUNC_ARTANH_NAME=115
+FUNC_ARCTANH_NAME=116
+FUNC_GCD_NAME=117
+FUNC_LCM_NAME=118
+FUNC_FLOOR_NAME=119
+FUNC_CEIL_NAME=120
+FUNC_SQRT=121
+FUNC_GCD=122
+FUNC_LCM=123
+FUNC_FLOOR=124
+FUNC_CEIL=125
+FUNC_MAX=126
+FUNC_MIN=127
+FUNC_DET=128
+FUNC_EYE_NAME=129
+FUNC_ZEROS_NAME=130
+FUNC_ONES_NAME=131
+FUNC_COLS_NAME=132
+FUNC_ROWS_NAME=133
+FUNC_DIAG_NAME=134
+FUNC_NORM_NAME=135
+FUNC_RANK_NAME=136
+FUNC_TRACE_NAME=137
+FUNC_RREF_NAME=138
+FUNC_HSTACK_NAME=139
+FUNC_VSTACK_NAME=140
+FUNC_ORTHOGONALIZE_NAME=141
+FUNC_NULLSPACE_NAME=142
+FUNC_DIAGONALIZE_NAME=143
+FUNC_EIGENVALS_NAME=144
+FUNC_EIGENVECTORS_NAME=145
+FUNC_SVD_NAME=146
+CMD_TIMES=147
+CMD_CDOT=148
+CMD_DIV=149
+CMD_FRAC=150
+CMD_BINOM=151
+CMD_CHOOSE=152
+CMD_MOD=153
+CMD_MATHIT=154
+CMD_OPERATORNAME=155
+MATRIX_TYPE_MATRIX=156
+MATRIX_TYPE_PMATRIX=157
+MATRIX_TYPE_BMATRIX=158
+MATRIX_TYPE_DET=159
+MATRIX_TYPES=160
+CMD_MATRIX_START=161
+CMD_MATRIX_END=162
+CMD_DET_START=163
+CMD_DET_END=164
+MATRIX_DEL_COL=165
+MATRIX_DEL_ROW=166
+UNDERSCORE=167
+CARET=168
+COLON=169
+SEMICOLON=170
+COMMA=171
+PERIOD=172
+DIFFERENTIAL=173
+EXP_E=174
+E_NOTATION_E=175
+LETTER_NO_E=176
+MATRIX_XRIGHTARROW=177
+TRANSFORM_EXCHANGE=178
+NUMBER=179
+E_NOTATION=180
+IN=181
+ASSIGNMENT=182
+EQUAL=183
+LT=184
+LTE=185
+GT=186
+GTE=187
+UNEQUAL=188
+BANG=189
+PERCENT_NUMBER=190
+GREEK_CMD=191
+OTHER_SYMBOL_CMD=192
+SYMBOL=193
+VARIABLE=194
+'\\acute'=1
+'\\bar'=2
+'\\overline'=3
+'\\breve'=4
+'\\check'=5
+'\\widecheck'=6
+'\\dot'=7
+'\\ddot'=8
+'\\grave'=9
+'\\hat'=10
+'\\tilde'=11
+'\\widetilde'=12
+'\\vec'=13
+'\\overrightarrow'=14
+'\\bm'=15
+'\\boldsymbol'=16
+'\\text'=17
+'\\textit'=18
+'\\mathbb'=19
+'\\mathbin'=20
+'\\mathbf'=21
+'\\mathcal'=22
+'\\mathclap'=23
+'\\mathclose'=24
+'\\mathellipsis'=25
+'\\mathfrak'=26
+'\\mathinner'=27
+'\\mathnormal'=28
+'\\mathop'=29
+'\\mathopen'=30
+'\\mathord'=31
+'\\mathpunct'=32
+'\\mathrel'=33
+'\\mathring'=34
+'\\mathrlap'=35
+'\\mathrm'=36
+'\\mathscr'=37
+'\\mathsf'=38
+'\\mathsterling'=39
+'\\mathtt'=40
+'^T'=41
+'^{T}'=42
+'^{\\top}'=43
+'\''=44
+'\\$'=46
+'+'=47
+'-'=48
+'*'=49
+'('=51
+')'=52
+'\\lgroup'=53
+'\\rgroup'=54
+'{'=55
+'}'=56
+'\\{'=57
+'\\}'=58
+'\\lbrace'=59
+'\\rbrace'=60
+'['=61
+']'=62
+'\\lbrack'=63
+'\\rbrack'=64
+'|'=65
+'\\lvert'=66
+'\\rvert'=67
+'\\vert'=68
+'\\|'=69
+'\\lfloor'=70
+'\\rfloor'=71
+'\\llcorner'=72
+'\\lrcorner'=73
+'\\lceil'=74
+'\\rceil'=75
+'\\ulcorner'=76
+'\\urcorner'=77
+'\\left'=78
+'\\right'=79
+'\\mleft'=80
+'\\mright'=81
+'\\lim'=82
+'\\int'=84
+'\\sum'=85
+'\\prod'=86
+'\\log'=87
+'\\ln'=88
+'\\exp'=89
+'\\sin'=90
+'\\cos'=91
+'\\tan'=92
+'\\csc'=93
+'\\sec'=94
+'\\cot'=95
+'\\arcsin'=96
+'\\arccos'=97
+'\\arctan'=98
+'\\arccsc'=99
+'\\arcsec'=100
+'\\arccot'=101
+'\\sinh'=102
+'\\cosh'=103
+'\\tanh'=104
+'\\arsinh'=105
+'\\arcosh'=106
+'\\artanh'=107
+'\\arcsinh'=108
+'\\arccosh'=109
+'\\arctanh'=110
+'arsinh'=111
+'arcsinh'=112
+'arcosh'=113
+'arccosh'=114
+'artanh'=115
+'arctanh'=116
+'gcd'=117
+'lcm'=118
+'floor'=119
+'ceil'=120
+'\\sqrt'=121
+'\\gcd'=122
+'\\lcm'=123
+'\\floor'=124
+'\\ceil'=125
+'\\max'=126
+'\\min'=127
+'\\det'=128
+'eye'=129
+'zeros'=130
+'ones'=131
+'cols'=132
+'rows'=133
+'diag'=134
+'norm'=135
+'rank'=136
+'rref'=138
+'hstack'=139
+'vstack'=140
+'nullspace'=142
+'\\times'=147
+'\\cdot'=148
+'\\div'=149
+'\\frac'=150
+'\\choose'=152
+'\\mod'=153
+'\\mathit'=154
+'\\operatorname'=155
+'matrix'=156
+'pmatrix'=157
+'bmatrix'=158
+'vmatrix'=159
+'&'=165
+'\\\\'=166
+'_'=167
+'^'=168
+':'=169
+';'=170
+','=171
+'.'=172
+'E'=175
+'\\in'=181
+'='=182
+'<'=184
+'>'=186
+'!'=189

latex2sympy/gen/PSListener.py

@@ -0,0 +1,573 @@
+# Generated from PS.g4 by ANTLR 4.11.1
+from antlr4 import *
+
+# This class defines a complete listener for a parse tree produced by PSParser.
+
+
+class PSListener(ParseTreeListener):
+
+    # Enter a parse tree produced by PSParser#accent_symbol.
+    def enterAccent_symbol(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#accent_symbol.
+    def exitAccent_symbol(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#math.
+
+    def enterMath(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#math.
+    def exitMath(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#transpose.
+
+    def enterTranspose(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#transpose.
+    def exitTranspose(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#transform_atom.
+
+    def enterTransform_atom(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#transform_atom.
+    def exitTransform_atom(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#transform_scale.
+
+    def enterTransform_scale(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#transform_scale.
+    def exitTransform_scale(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#transform_swap.
+
+    def enterTransform_swap(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#transform_swap.
+    def exitTransform_swap(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#transform_assignment.
+
+    def enterTransform_assignment(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#transform_assignment.
+    def exitTransform_assignment(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#elementary_transform.
+
+    def enterElementary_transform(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#elementary_transform.
+    def exitElementary_transform(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#elementary_transforms.
+
+    def enterElementary_transforms(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#elementary_transforms.
+    def exitElementary_transforms(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#matrix.
+
+    def enterMatrix(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#matrix.
+    def exitMatrix(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#det.
+
+    def enterDet(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#det.
+    def exitDet(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#matrix_row.
+
+    def enterMatrix_row(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#matrix_row.
+    def exitMatrix_row(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#relation.
+
+    def enterRelation(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#relation.
+    def exitRelation(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#relation_list.
+
+    def enterRelation_list(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#relation_list.
+    def exitRelation_list(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#relation_list_content.
+
+    def enterRelation_list_content(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#relation_list_content.
+    def exitRelation_list_content(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#equality.
+
+    def enterEquality(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#equality.
+    def exitEquality(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#expr.
+
+    def enterExpr(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#expr.
+    def exitExpr(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#additive.
+
+    def enterAdditive(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#additive.
+    def exitAdditive(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#mp.
+
+    def enterMp(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#mp.
+    def exitMp(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#mp_nofunc.
+
+    def enterMp_nofunc(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#mp_nofunc.
+    def exitMp_nofunc(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#unary.
+
+    def enterUnary(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#unary.
+    def exitUnary(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#unary_nofunc.
+
+    def enterUnary_nofunc(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#unary_nofunc.
+    def exitUnary_nofunc(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#postfix.
+
+    def enterPostfix(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#postfix.
+    def exitPostfix(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#postfix_nofunc.
+
+    def enterPostfix_nofunc(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#postfix_nofunc.
+    def exitPostfix_nofunc(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#postfix_op.
+
+    def enterPostfix_op(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#postfix_op.
+    def exitPostfix_op(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#eval_at.
+
+    def enterEval_at(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#eval_at.
+    def exitEval_at(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#eval_at_sub.
+
+    def enterEval_at_sub(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#eval_at_sub.
+    def exitEval_at_sub(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#eval_at_sup.
+
+    def enterEval_at_sup(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#eval_at_sup.
+    def exitEval_at_sup(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#exp.
+
+    def enterExp(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#exp.
+    def exitExp(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#exp_nofunc.
+
+    def enterExp_nofunc(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#exp_nofunc.
+    def exitExp_nofunc(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#comp.
+
+    def enterComp(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#comp.
+    def exitComp(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#comp_nofunc.
+
+    def enterComp_nofunc(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#comp_nofunc.
+    def exitComp_nofunc(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#group.
+
+    def enterGroup(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#group.
+    def exitGroup(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#norm_group.
+
+    def enterNorm_group(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#norm_group.
+    def exitNorm_group(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#abs_group.
+
+    def enterAbs_group(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#abs_group.
+    def exitAbs_group(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#floor_group.
+
+    def enterFloor_group(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#floor_group.
+    def exitFloor_group(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#ceil_group.
+
+    def enterCeil_group(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#ceil_group.
+    def exitCeil_group(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#accent.
+
+    def enterAccent(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#accent.
+    def exitAccent(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#atom_expr_no_supexpr.
+
+    def enterAtom_expr_no_supexpr(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#atom_expr_no_supexpr.
+    def exitAtom_expr_no_supexpr(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#atom_expr.
+
+    def enterAtom_expr(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#atom_expr.
+    def exitAtom_expr(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#atom.
+
+    def enterAtom(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#atom.
+    def exitAtom(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#mathit.
+
+    def enterMathit(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#mathit.
+    def exitMathit(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#mathit_text.
+
+    def enterMathit_text(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#mathit_text.
+    def exitMathit_text(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#frac.
+
+    def enterFrac(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#frac.
+    def exitFrac(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#binom.
+
+    def enterBinom(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#binom.
+    def exitBinom(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#func_normal_functions_single_arg.
+
+    def enterFunc_normal_functions_single_arg(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#func_normal_functions_single_arg.
+    def exitFunc_normal_functions_single_arg(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#func_normal_functions_multi_arg.
+
+    def enterFunc_normal_functions_multi_arg(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#func_normal_functions_multi_arg.
+    def exitFunc_normal_functions_multi_arg(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#func_operator_names_single_arg.
+
+    def enterFunc_operator_names_single_arg(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#func_operator_names_single_arg.
+    def exitFunc_operator_names_single_arg(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#func_operator_names_multi_arg.
+
+    def enterFunc_operator_names_multi_arg(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#func_operator_names_multi_arg.
+    def exitFunc_operator_names_multi_arg(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#func_normal_single_arg.
+
+    def enterFunc_normal_single_arg(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#func_normal_single_arg.
+    def exitFunc_normal_single_arg(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#func_normal_multi_arg.
+
+    def enterFunc_normal_multi_arg(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#func_normal_multi_arg.
+    def exitFunc_normal_multi_arg(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#func.
+
+    def enterFunc(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#func.
+    def exitFunc(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#args.
+
+    def enterArgs(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#args.
+    def exitArgs(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#func_common_args.
+
+    def enterFunc_common_args(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#func_common_args.
+    def exitFunc_common_args(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#limit_sub.
+
+    def enterLimit_sub(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#limit_sub.
+    def exitLimit_sub(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#func_single_arg.
+
+    def enterFunc_single_arg(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#func_single_arg.
+    def exitFunc_single_arg(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#func_single_arg_noparens.
+
+    def enterFunc_single_arg_noparens(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#func_single_arg_noparens.
+    def exitFunc_single_arg_noparens(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#func_multi_arg.
+
+    def enterFunc_multi_arg(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#func_multi_arg.
+    def exitFunc_multi_arg(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#func_multi_arg_noparens.
+
+    def enterFunc_multi_arg_noparens(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#func_multi_arg_noparens.
+    def exitFunc_multi_arg_noparens(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#subexpr.
+
+    def enterSubexpr(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#subexpr.
+    def exitSubexpr(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#supexpr.
+
+    def enterSupexpr(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#supexpr.
+    def exitSupexpr(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#subeq.
+
+    def enterSubeq(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#subeq.
+    def exitSubeq(self, ctx):
+        pass
+
+    # Enter a parse tree produced by PSParser#supeq.
+
+    def enterSupeq(self, ctx):
+        pass
+
+    # Exit a parse tree produced by PSParser#supeq.
+    def exitSupeq(self, ctx):
+        pass

latex2sympy/latex2sympy2.py

@@ -0,0 +1,1162 @@
+import sympy
+import re
+from sympy import matrix_symbols, simplify, factor, expand, apart, expand_trig
+from antlr4 import InputStream, CommonTokenStream
+from antlr4.error.ErrorListener import ErrorListener
+
+try:
+    from gen.PSParser import PSParser
+    from gen.PSLexer import PSLexer
+    from gen.PSListener import PSListener
+except Exception:
+    from .gen.PSParser import PSParser
+    from .gen.PSLexer import PSLexer
+    from .gen.PSListener import PSListener
+
+from sympy.printing.str import StrPrinter
+
+from sympy.parsing.sympy_parser import parse_expr
+
+import hashlib
+
+is_real = None
+
+frac_type = r'\frac'
+
+variances = {}
+var = {}
+
+VARIABLE_VALUES = {}
+
+
+def set_real(value):
+    global is_real
+    is_real = value
+
+
+def set_variances(vars):
+    global variances
+    variances = vars
+    global var
+    var = {}
+    for variance in vars:
+        var[str(variance)] = vars[variance]
+
+
+def latex2sympy(sympy: str, variable_values={}):
+    # record frac
+    global frac_type
+    if sympy.find(r'\frac') != -1:
+        frac_type = r'\frac'
+    if sympy.find(r'\dfrac') != -1:
+        frac_type = r'\dfrac'
+    if sympy.find(r'\tfrac') != -1:
+        frac_type = r'\tfrac'
+    sympy = sympy.replace(r'\dfrac', r'\frac')
+    sympy = sympy.replace(r'\tfrac', r'\frac')
+    # Translate Transpose
+    sympy = sympy.replace(r'\mathrm{T}', 'T', -1)
+    # Translate Derivative
+    sympy = sympy.replace(r'\mathrm{d}', 'd', -1).replace(r'{\rm d}', 'd', -1)
+    # Translate Matrix
+    sympy = sympy.replace(r'\left[\begin{matrix}', r'\begin{bmatrix}', -1).replace(r'\end{matrix}\right]', r'\end{bmatrix}', -1)
+    # Translate Permutation
+    sympy = re.sub(r"\(([a-zA-Z0-9+\-*/\\ ]+?)\)_{([a-zA-Z0-9+\-*/\\ ]+?)}", r"\\frac{(\1)!}{((\1)-(\2))!}", sympy)
+    # Remove \displaystyle
+    sympy = sympy.replace(r'\displaystyle', ' ', -1)
+    # Remove \quad
+    sympy = sympy.replace(r'\quad', ' ', -1).replace(r'\qquad', ' ', -1).replace(r'~', ' ', -1).replace(r'\,', ' ', -1)
+    # Remove $
+    sympy = sympy.replace(r'$', ' ', -1)
+
+    # variable values
+    global VARIABLE_VALUES
+    if len(variable_values) > 0:
+        VARIABLE_VALUES = variable_values
+    else:
+        VARIABLE_VALUES = {}
+
+    # setup listener
+    matherror = MathErrorListener(sympy)
+
+    # stream input
+    stream = InputStream(sympy)
+    lex = PSLexer(stream)
+    lex.removeErrorListeners()
+    lex.addErrorListener(matherror)
+
+    tokens = CommonTokenStream(lex)
+    parser = PSParser(tokens)
+
+    # remove default console error listener
+    parser.removeErrorListeners()
+    parser.addErrorListener(matherror)
+
+    # process the input
+    return_data = None
+    math = parser.math()
+
+    # if a list
+    if math.relation_list():
+        return_data = []
+
+        # go over list items
+        relation_list = math.relation_list().relation_list_content()
+        for list_item in relation_list.relation():
+            expr = convert_relation(list_item)
+            return_data.append(expr)
+
+    # if not, do default
+    else:
+        relation = math.relation()
+        return_data = convert_relation(relation)
+
+    return return_data
+
+
+class MathErrorListener(ErrorListener):
+    def __init__(self, src):
+        super(ErrorListener, self).__init__()
+        self.src = src
+
+    def syntaxError(self, recog, symbol, line, col, msg, e):
+        fmt = "%s\n%s\n%s"
+        marker = "~" * col + "^"
+
+        if msg.startswith("missing"):
+            err = fmt % (msg, self.src, marker)
+        elif msg.startswith("no viable"):
+            err = fmt % ("I expected something else here", self.src, marker)
+        elif msg.startswith("mismatched"):
+            names = PSParser.literalNames
+            expected = [names[i] for i in e.getExpectedTokens() if i < len(names)]
+            if len(expected) < 10:
+                expected = " ".join(expected)
+                err = (fmt % ("I expected one of these: " + expected,
+                              self.src, marker))
+            else:
+                err = (fmt % ("I expected something else here", self.src, marker))
+        else:
+            err = fmt % ("I don't understand this", self.src, marker)
+        raise Exception(err)
+
+
+def convert_relation(rel):
+    if rel.expr():
+        return convert_expr(rel.expr())
+
+    lh = convert_relation(rel.relation(0))
+    rh = convert_relation(rel.relation(1))
+    if rel.LT():
+        return sympy.StrictLessThan(lh, rh, evaluate=False)
+    elif rel.LTE():
+        return sympy.LessThan(lh, rh, evaluate=False)
+    elif rel.GT():
+        return sympy.StrictGreaterThan(lh, rh, evaluate=False)
+    elif rel.GTE():
+        return sympy.GreaterThan(lh, rh, evaluate=False)
+    elif rel.EQUAL():
+        return sympy.Eq(lh, rh, evaluate=False)
+    elif rel.ASSIGNMENT():
+        # !Use Global variances
+        if lh.is_Symbol:
+            # set value
+            variances[lh] = rh
+            var[str(lh)] = rh
+            return rh
+        else:
+            # find the symbols in lh - rh
+            equation = lh - rh
+            syms = equation.atoms(sympy.Symbol)
+            if len(syms) > 0:
+                # Solve equation
+                result = []
+                for sym in syms:
+                    values = sympy.solve(equation, sym)
+                    for value in values:
+                        result.append(sympy.Eq(sym, value, evaluate=False))
+                return result
+            else:
+                return sympy.Eq(lh, rh, evaluate=False)
+    elif rel.IN():
+        # !Use Global variances
+        if hasattr(rh, 'is_Pow') and rh.is_Pow and hasattr(rh.exp, 'is_Mul'):
+            n = rh.exp.args[0]
+            m = rh.exp.args[1]
+            if n in variances:
+                n = variances[n]
+            if m in variances:
+                m = variances[m]
+            rh = sympy.MatrixSymbol(lh, n, m)
+            variances[lh] = rh
+            var[str(lh)] = rh
+        else:
+            raise Exception("Don't support this form of definition of matrix symbol.")
+        return lh
+    elif rel.UNEQUAL():
+        return sympy.Ne(lh, rh, evaluate=False)
+
+
+def convert_expr(expr):
+    if expr.additive():
+        return convert_add(expr.additive())
+
+
+def convert_elementary_transform(matrix, transform):
+    if transform.transform_scale():
+        transform_scale = transform.transform_scale()
+        transform_atom = transform_scale.transform_atom()
+        k = None
+        num = int(transform_atom.NUMBER().getText()) - 1
+        if transform_scale.expr():
+            k = convert_expr(transform_scale.expr())
+        elif transform_scale.group():
+            k = convert_expr(transform_scale.group().expr())
+        elif transform_scale.SUB():
+            k = -1
+        else:
+            k = 1
+        if transform_atom.LETTER_NO_E().getText() == 'r':
+            matrix = matrix.elementary_row_op(op='n->kn', row=num, k=k)
+        elif transform_atom.LETTER_NO_E().getText() == 'c':
+            matrix = matrix.elementary_col_op(op='n->kn', col=num, k=k)
+        else:
+            raise Exception('Row and col don\'s match')
+
+    elif transform.transform_swap():
+        first_atom = transform.transform_swap().transform_atom()[0]
+        second_atom = transform.transform_swap().transform_atom()[1]
+        first_num = int(first_atom.NUMBER().getText()) - 1
+        second_num = int(second_atom.NUMBER().getText()) - 1
+        if first_atom.LETTER_NO_E().getText() != second_atom.LETTER_NO_E().getText():
+            raise Exception('Row and col don\'s match')
+        elif first_atom.LETTER_NO_E().getText() == 'r':
+            matrix = matrix.elementary_row_op(op='n<->m', row1=first_num, row2=second_num)
+        elif first_atom.LETTER_NO_E().getText() == 'c':
+            matrix = matrix.elementary_col_op(op='n<->m', col1=first_num, col2=second_num)
+        else:
+            raise Exception('Row and col don\'s match')
+
+    elif transform.transform_assignment():
+        first_atom = transform.transform_assignment().transform_atom()
+        second_atom = transform.transform_assignment().transform_scale().transform_atom()
+        transform_scale = transform.transform_assignment().transform_scale()
+        k = None
+        if transform_scale.expr():
+            k = convert_expr(transform_scale.expr())
+        elif transform_scale.group():
+            k = convert_expr(transform_scale.group().expr())
+        elif transform_scale.SUB():
+            k = -1
+        else:
+            k = 1
+        first_num = int(first_atom.NUMBER().getText()) - 1
+        second_num = int(second_atom.NUMBER().getText()) - 1
+        if first_atom.LETTER_NO_E().getText() != second_atom.LETTER_NO_E().getText():
+            raise Exception('Row and col don\'s match')
+        elif first_atom.LETTER_NO_E().getText() == 'r':
+            matrix = matrix.elementary_row_op(op='n->n+km', k=k, row1=first_num, row2=second_num)
+        elif first_atom.LETTER_NO_E().getText() == 'c':
+            matrix = matrix.elementary_col_op(op='n->n+km', k=k, col1=first_num, col2=second_num)
+        else:
+            raise Exception('Row and col don\'s match')
+
+    return matrix
+
+
+def convert_matrix(matrix):
+    # build matrix
+    row = matrix.matrix_row()
+    tmp = []
+    rows = 0
+    mat = None
+
+    for r in row:
+        tmp.append([])
+        for expr in r.expr():
+            tmp[rows].append(convert_expr(expr))
+        rows = rows + 1
+
+    mat = sympy.Matrix(tmp)
+
+    if hasattr(matrix, 'MATRIX_XRIGHTARROW') and matrix.MATRIX_XRIGHTARROW():
+        transforms_list = matrix.elementary_transforms()
+        if len(transforms_list) == 1:
+            for transform in transforms_list[0].elementary_transform():
+                mat = convert_elementary_transform(mat, transform)
+        elif len(transforms_list) == 2:
+            # firstly transform top of xrightarrow
+            for transform in transforms_list[1].elementary_transform():
+                mat = convert_elementary_transform(mat, transform)
+            # firstly transform bottom of xrightarrow
+            for transform in transforms_list[0].elementary_transform():
+                mat = convert_elementary_transform(mat, transform)
+
+    return mat
+
+
+def add_flat(lh, rh):
+    if hasattr(lh, 'is_Add') and lh.is_Add or hasattr(rh, 'is_Add') and rh.is_Add:
+        args = []
+        if hasattr(lh, 'is_Add') and lh.is_Add:
+            args += list(lh.args)
+        else:
+            args += [lh]
+        if hasattr(rh, 'is_Add') and rh.is_Add:
+            args = args + list(rh.args)
+        else:
+            args += [rh]
+        return sympy.Add(*args, evaluate=False)
+    else:
+        return sympy.Add(lh, rh, evaluate=False)
+
+
+def mat_add_flat(lh, rh):
+    if hasattr(lh, 'is_MatAdd') and lh.is_MatAdd or hasattr(rh, 'is_MatAdd') and rh.is_MatAdd:
+        args = []
+        if hasattr(lh, 'is_MatAdd') and lh.is_MatAdd:
+            args += list(lh.args)
+        else:
+            args += [lh]
+        if hasattr(rh, 'is_MatAdd') and rh.is_MatAdd:
+            args = args + list(rh.args)
+        else:
+            args += [rh]
+        return sympy.MatAdd(*[arg.doit() for arg in args], evaluate=False)
+    else:
+        return sympy.MatAdd(lh.doit(), rh.doit(), evaluate=False)
+
+
+def mul_flat(lh, rh):
+    if hasattr(lh, 'is_Mul') and lh.is_Mul or hasattr(rh, 'is_Mul') and rh.is_Mul:
+        args = []
+        if hasattr(lh, 'is_Mul') and lh.is_Mul:
+            args += list(lh.args)
+        else:
+            args += [lh]
+        if hasattr(rh, 'is_Mul') and rh.is_Mul:
+            args = args + list(rh.args)
+        else:
+            args += [rh]
+        return sympy.Mul(*args, evaluate=False)
+    else:
+        return sympy.Mul(lh, rh, evaluate=False)
+
+
+def mat_mul_flat(lh, rh):
+    if hasattr(lh, 'is_MatMul') and lh.is_MatMul or hasattr(rh, 'is_MatMul') and rh.is_MatMul:
+        args = []
+        if hasattr(lh, 'is_MatMul') and lh.is_MatMul:
+            args += list(lh.args)
+        else:
+            args += [lh]
+        if hasattr(rh, 'is_MatMul') and rh.is_MatMul:
+            args = args + list(rh.args)
+        else:
+            args += [rh]
+        return sympy.MatMul(*[arg.doit() for arg in args], evaluate=False)
+    else:
+        if hasattr(lh, 'doit') and hasattr(rh, 'doit'):
+            return sympy.MatMul(lh.doit(), rh.doit(), evaluate=False)
+        elif hasattr(lh, 'doit') and not hasattr(rh, 'doit'):
+            return sympy.MatMul(lh.doit(), rh, evaluate=False)
+        elif not hasattr(lh, 'doit') and hasattr(rh, 'doit'):
+            return sympy.MatMul(lh, rh.doit(), evaluate=False)
+        else:
+            return sympy.MatMul(lh, rh, evaluate=False)
+
+
+def convert_add(add):
+    if add.ADD():
+        lh = convert_add(add.additive(0))
+        rh = convert_add(add.additive(1))
+
+        if lh.is_Matrix or rh.is_Matrix:
+            return mat_add_flat(lh, rh)
+        else:
+            return add_flat(lh, rh)
+    elif add.SUB():
+        lh = convert_add(add.additive(0))
+        rh = convert_add(add.additive(1))
+
+        if lh.is_Matrix or rh.is_Matrix:
+            return mat_add_flat(lh, mat_mul_flat(-1, rh))
+        else:
+            # If we want to force ordering for variables this should be:
+            # return Sub(lh, rh, evaluate=False)
+            if not rh.is_Matrix and rh.func.is_Number:
+                rh = -rh
+            else:
+                rh = mul_flat(-1, rh)
+            return add_flat(lh, rh)
+    else:
+        return convert_mp(add.mp())
+
+
+def convert_mp(mp):
+    if hasattr(mp, 'mp'):
+        mp_left = mp.mp(0)
+        mp_right = mp.mp(1)
+    else:
+        mp_left = mp.mp_nofunc(0)
+        mp_right = mp.mp_nofunc(1)
+
+    if mp.MUL() or mp.CMD_TIMES() or mp.CMD_CDOT():
+        lh = convert_mp(mp_left)
+        rh = convert_mp(mp_right)
+
+        if lh.is_Matrix or rh.is_Matrix:
+            return mat_mul_flat(lh, rh)
+        else:
+            return mul_flat(lh, rh)
+    elif mp.DIV() or mp.CMD_DIV() or mp.COLON():
+        lh = convert_mp(mp_left)
+        rh = convert_mp(mp_right)
+        if lh.is_Matrix or rh.is_Matrix:
+            return sympy.MatMul(lh, sympy.Pow(rh, -1, evaluate=False), evaluate=False)
+        else:
+            return sympy.Mul(lh, sympy.Pow(rh, -1, evaluate=False), evaluate=False)
+    elif mp.CMD_MOD():
+        lh = convert_mp(mp_left)
+        rh = convert_mp(mp_right)
+        if rh.is_Matrix:
+            raise Exception("Cannot perform modulo operation with a matrix as an operand")
+        else:
+            return sympy.Mod(lh, rh, evaluate=False)
+    else:
+        if hasattr(mp, 'unary'):
+            return convert_unary(mp.unary())
+        else:
+            return convert_unary(mp.unary_nofunc())
+
+
+def convert_unary(unary):
+    if hasattr(unary, 'unary'):
+        nested_unary = unary.unary()
+    else:
+        nested_unary = unary.unary_nofunc()
+    if hasattr(unary, 'postfix_nofunc'):
+        first = unary.postfix()
+        tail = unary.postfix_nofunc()
+        postfix = [first] + tail
+    else:
+        postfix = unary.postfix()
+
+    if unary.ADD():
+        return convert_unary(nested_unary)
+    elif unary.SUB():
+        tmp_convert_nested_unary = convert_unary(nested_unary)
+        if tmp_convert_nested_unary.is_Matrix:
+            return mat_mul_flat(-1, tmp_convert_nested_unary, evaluate=False)
+        else:
+            if tmp_convert_nested_unary.func.is_Number:
+                return -tmp_convert_nested_unary
+            else:
+                return mul_flat(-1, tmp_convert_nested_unary)
+    elif postfix:
+        return convert_postfix_list(postfix)
+
+
+def convert_postfix_list(arr, i=0):
+    if i >= len(arr):
+        raise Exception("Index out of bounds")
+
+    res = convert_postfix(arr[i])
+
+    if isinstance(res, sympy.Expr) or isinstance(res, sympy.Matrix) or res is sympy.S.EmptySet:
+        if i == len(arr) - 1:
+            return res  # nothing to multiply by
+        else:
+            # multiply by next
+            rh = convert_postfix_list(arr, i + 1)
+
+            if res.is_Matrix or rh.is_Matrix:
+                return mat_mul_flat(res, rh)
+            else:
+                return mul_flat(res, rh)
+    elif isinstance(res, tuple) or isinstance(res, list) or isinstance(res, dict):
+        return res
+    else:  # must be derivative
+        wrt = res[0]
+        if i == len(arr) - 1:
+            raise Exception("Expected expression for derivative")
+        else:
+            expr = convert_postfix_list(arr, i + 1)
+            return sympy.Derivative(expr, wrt)
+
+
+def do_subs(expr, at):
+    if at.expr():
+        at_expr = convert_expr(at.expr())
+        syms = at_expr.atoms(sympy.Symbol)
+        if len(syms) == 0:
+            return expr
+        elif len(syms) > 0:
+            sym = next(iter(syms))
+            return expr.subs(sym, at_expr)
+    elif at.equality():
+        lh = convert_expr(at.equality().expr(0))
+        rh = convert_expr(at.equality().expr(1))
+        return expr.subs(lh, rh)
+
+
+def convert_postfix(postfix):
+    if hasattr(postfix, 'exp'):
+        exp_nested = postfix.exp()
+    else:
+        exp_nested = postfix.exp_nofunc()
+
+    exp = convert_exp(exp_nested)
+    for op in postfix.postfix_op():
+        if op.BANG():
+            if isinstance(exp, list):
+                raise Exception("Cannot apply postfix to derivative")
+            exp = sympy.factorial(exp, evaluate=False)
+        elif op.eval_at():
+            ev = op.eval_at()
+            at_b = None
+            at_a = None
+            if ev.eval_at_sup():
+                at_b = do_subs(exp, ev.eval_at_sup())
+            if ev.eval_at_sub():
+                at_a = do_subs(exp, ev.eval_at_sub())
+            if at_b is not None and at_a is not None:
+                exp = add_flat(at_b, mul_flat(at_a, -1))
+            elif at_b is not None:
+                exp = at_b
+            elif at_a is not None:
+                exp = at_a
+        elif op.transpose():
+            try:
+                exp = exp.T
+            except:
+                try:
+                    exp = sympy.transpose(exp)
+                except:
+                    pass
+                pass
+
+    return exp
+
+
+def convert_exp(exp):
+    if hasattr(exp, 'exp'):
+        exp_nested = exp.exp()
+    else:
+        exp_nested = exp.exp_nofunc()
+
+    if exp_nested:
+        base = convert_exp(exp_nested)
+        if isinstance(base, list):
+            raise Exception("Cannot raise derivative to power")
+        if exp.atom():
+            exponent = convert_atom(exp.atom())
+        elif exp.expr():
+            exponent = convert_expr(exp.expr())
+        return sympy.Pow(base, exponent, evaluate=False)
+    else:
+        if hasattr(exp, 'comp'):
+            return convert_comp(exp.comp())
+        else:
+            return convert_comp(exp.comp_nofunc())
+
+
+def convert_comp(comp):
+    if comp.group():
+        return convert_expr(comp.group().expr())
+    elif comp.norm_group():
+        return convert_expr(comp.norm_group().expr()).norm()
+    elif comp.abs_group():
+        return sympy.Abs(convert_expr(comp.abs_group().expr()), evaluate=False)
+    elif comp.floor_group():
+        return handle_floor(convert_expr(comp.floor_group().expr()))
+    elif comp.ceil_group():
+        return handle_ceil(convert_expr(comp.ceil_group().expr()))
+    elif comp.atom():
+        return convert_atom(comp.atom())
+    elif comp.frac():
+        return convert_frac(comp.frac())
+    elif comp.binom():
+        return convert_binom(comp.binom())
+    elif comp.matrix():
+        return convert_matrix(comp.matrix())
+    elif comp.det():
+        # !Use Global variances
+        return convert_matrix(comp.det()).subs(variances).det()
+    elif comp.func():
+        return convert_func(comp.func())
+
+
+def convert_atom(atom):
+    if atom.atom_expr():
+        atom_expr = atom.atom_expr()
+
+        # find the atom's text
+        atom_text = ''
+        if atom_expr.LETTER_NO_E():
+            atom_text = atom_expr.LETTER_NO_E().getText()
+            if atom_text == "I":
+                return sympy.I
+        elif atom_expr.GREEK_CMD():
+            atom_text = atom_expr.GREEK_CMD().getText()[1:].strip()
+        elif atom_expr.OTHER_SYMBOL_CMD():
+            atom_text = atom_expr.OTHER_SYMBOL_CMD().getText().strip()
+        elif atom_expr.accent():
+            atom_accent = atom_expr.accent()
+            # get name for accent
+            name = atom_accent.start.text
+            # name = atom_accent.start.text[1:]
+            # exception: check if bar or overline which are treated both as bar
+            # if name in ["bar", "overline"]:
+            #     name = "bar"
+            # if name in ["vec", "overrightarrow"]:
+            #     name = "vec"
+            # if name in ["tilde", "widetilde"]:
+            #     name = "tilde"
+            # get the base (variable)
+            base = atom_accent.base.getText()
+            # set string to base+name
+            atom_text = name + '{' + base + '}'
+
+        # find atom's subscript, if any
+        subscript_text = ''
+        if atom_expr.subexpr():
+            subexpr = atom_expr.subexpr()
+            subscript = None
+            if subexpr.expr():  # subscript is expr
+                subscript = subexpr.expr().getText().strip()
+            elif subexpr.atom():  # subscript is atom
+                subscript = subexpr.atom().getText().strip()
+            elif subexpr.args():  # subscript is args
+                subscript = subexpr.args().getText().strip()
+            subscript_inner_text = StrPrinter().doprint(subscript)
+            if len(subscript_inner_text) > 1:
+                subscript_text = '_{' + subscript_inner_text + '}'
+            else:
+                subscript_text = '_' + subscript_inner_text
+
+        # construct the symbol using the text and optional subscript
+        atom_symbol = sympy.Symbol(atom_text + subscript_text, real=is_real)
+        # for matrix symbol
+        matrix_symbol = None
+        global var
+        if atom_text + subscript_text in var:
+            try:
+                rh = var[atom_text + subscript_text]
+                shape = sympy.shape(rh)
+                matrix_symbol = sympy.MatrixSymbol(atom_text + subscript_text, shape[0], shape[1])
+                variances[matrix_symbol] = variances[atom_symbol]
+            except:
+                pass
+
+        # find the atom's superscript, and return as a Pow if found
+        if atom_expr.supexpr():
+            supexpr = atom_expr.supexpr()
+            func_pow = None
+            if supexpr.expr():
+                func_pow = convert_expr(supexpr.expr())
+            else:
+                func_pow = convert_atom(supexpr.atom())
+            return sympy.Pow(atom_symbol, func_pow, evaluate=False)
+
+        return atom_symbol if not matrix_symbol else matrix_symbol
+    elif atom.SYMBOL():
+        s = atom.SYMBOL().getText().replace("\\$", "").replace("\\%", "")
+        if s == "\\infty":
+            return sympy.oo
+        elif s == '\\pi':
+            return sympy.pi
+        elif s == '\\emptyset':
+            return sympy.S.EmptySet
+        else:
+            raise Exception("Unrecognized symbol")
+    elif atom.NUMBER():
+        s = atom.NUMBER().getText().replace(",", "")
+        try:
+            sr = sympy.Rational(s)
+            return sr
+        except (TypeError, ValueError):
+            return sympy.Number(s)
+    elif atom.E_NOTATION():
+        s = atom.E_NOTATION().getText().replace(",", "")
+        try:
+            sr = sympy.Rational(s)
+            return sr
+        except (TypeError, ValueError):
+            return sympy.Number(s)
+    elif atom.DIFFERENTIAL():
+        var = get_differential_var(atom.DIFFERENTIAL())
+        return sympy.Symbol('d' + var.name, real=is_real)
+    elif atom.mathit():
+        text = rule2text(atom.mathit().mathit_text())
+        return sympy.Symbol(text, real=is_real)
+    elif atom.VARIABLE():
+        text = atom.VARIABLE().getText()
+        is_percent = text.endswith("\\%")
+        trim_amount = 3 if is_percent else 1
+        name = text[10:]
+        name = name[0:len(name) - trim_amount]
+
+        # add hash to distinguish from regular symbols
+        hash = hashlib.md5(name.encode()).hexdigest()
+        symbol_name = name + hash
+
+        # replace the variable for already known variable values
+        if name in VARIABLE_VALUES:
+            # if a sympy class
+            if isinstance(VARIABLE_VALUES[name], tuple(sympy.core.all_classes)):
+                symbol = VARIABLE_VALUES[name]
+
+            # if NOT a sympy class
+            else:
+                symbol = parse_expr(str(VARIABLE_VALUES[name]))
+        else:
+            symbol = sympy.Symbol(symbol_name, real=is_real)
+
+        if is_percent:
+            return sympy.Mul(symbol, sympy.Pow(100, -1, evaluate=False), evaluate=False)
+
+        # return the symbol
+        return symbol
+
+    elif atom.PERCENT_NUMBER():
+        text = atom.PERCENT_NUMBER().getText().replace("\\%", "").replace(",", "")
+        try:
+            number = sympy.Rational(text)
+        except (TypeError, ValueError):
+            number = sympy.Number(text)
+        percent = sympy.Rational(number, 100)
+        return percent
+
+
+def rule2text(ctx):
+    stream = ctx.start.getInputStream()
+    # starting index of starting token
+    startIdx = ctx.start.start
+    # stopping index of stopping token
+    stopIdx = ctx.stop.stop
+
+    return stream.getText(startIdx, stopIdx)
+
+
+def convert_frac(frac):
+    diff_op = False
+    partial_op = False
+    lower_itv = frac.lower.getSourceInterval()
+    lower_itv_len = lower_itv[1] - lower_itv[0] + 1
+    if (frac.lower.start == frac.lower.stop and
+            frac.lower.start.type == PSLexer.DIFFERENTIAL):
+        wrt = get_differential_var_str(frac.lower.start.text)
+        diff_op = True
+    elif (lower_itv_len == 2 and
+          frac.lower.start.type == PSLexer.SYMBOL and
+          frac.lower.start.text == '\\partial' and
+          (frac.lower.stop.type == PSLexer.LETTER_NO_E or frac.lower.stop.type == PSLexer.SYMBOL)):
+        partial_op = True
+        wrt = frac.lower.stop.text
+        if frac.lower.stop.type == PSLexer.SYMBOL:
+            wrt = wrt[1:]
+
+    if diff_op or partial_op:
+        wrt = sympy.Symbol(wrt, real=is_real)
+        if (diff_op and frac.upper.start == frac.upper.stop and
+            frac.upper.start.type == PSLexer.LETTER_NO_E and
+                frac.upper.start.text == 'd'):
+            return [wrt]
+        elif (partial_op and frac.upper.start == frac.upper.stop and
+              frac.upper.start.type == PSLexer.SYMBOL and
+              frac.upper.start.text == '\\partial'):
+            return [wrt]
+        upper_text = rule2text(frac.upper)
+
+        expr_top = None
+        if diff_op and upper_text.startswith('d'):
+            expr_top = latex2sympy(upper_text[1:])
+        elif partial_op and frac.upper.start.text == '\\partial':
+            expr_top = latex2sympy(upper_text[len('\\partial'):])
+        if expr_top:
+            return sympy.Derivative(expr_top, wrt)
+
+    expr_top = convert_expr(frac.upper)
+    expr_bot = convert_expr(frac.lower)
+    if expr_top.is_Matrix or expr_bot.is_Matrix:
+        return sympy.MatMul(expr_top, sympy.Pow(expr_bot, -1, evaluate=False), evaluate=False)
+    else:
+        return sympy.Mul(expr_top, sympy.Pow(expr_bot, -1, evaluate=False), evaluate=False)
+
+
+def convert_binom(binom):
+    expr_top = convert_expr(binom.upper)
+    expr_bot = convert_expr(binom.lower)
+    return sympy.binomial(expr_top, expr_bot)
+
+
+def convert_func(func):
+    if func.func_normal_single_arg():
+        if func.L_PAREN():  # function called with parenthesis
+            arg = convert_func_arg(func.func_single_arg())
+        else:
+            arg = convert_func_arg(func.func_single_arg_noparens())
+
+        name = func.func_normal_single_arg().start.text[1:]
+
+        # change arc<trig> -> a<trig>
+        if name in ["arcsin", "arccos", "arctan", "arccsc", "arcsec",
+                    "arccot"]:
+            name = "a" + name[3:]
+            expr = getattr(sympy.functions, name)(arg, evaluate=False)
+        elif name in ["arsinh", "arcosh", "artanh"]:
+            name = "a" + name[2:]
+            expr = getattr(sympy.functions, name)(arg, evaluate=False)
+        elif name in ["arcsinh", "arccosh", "arctanh"]:
+            name = "a" + name[3:]
+            expr = getattr(sympy.functions, name)(arg, evaluate=False)
+        elif name == "operatorname":
+            operatorname = func.func_normal_single_arg().func_operator_name.getText()
+
+            if operatorname in ["arsinh", "arcosh", "artanh"]:
+                operatorname = "a" + operatorname[2:]
+                expr = getattr(sympy.functions, operatorname)(arg, evaluate=False)
+            elif operatorname in ["arcsinh", "arccosh", "arctanh"]:
+                operatorname = "a" + operatorname[3:]
+                expr = getattr(sympy.functions, operatorname)(arg, evaluate=False)
+            elif operatorname == "floor":
+                expr = handle_floor(arg)
+            elif operatorname == "ceil":
+                expr = handle_ceil(arg)
+            elif operatorname == 'eye':
+                expr = sympy.eye(arg)
+            elif operatorname == 'rank':
+                expr = sympy.Integer(arg.rank())
+            elif operatorname in ['trace', 'tr']:
+                expr = arg.trace()
+            elif operatorname == 'rref':
+                expr = arg.rref()[0]
+            elif operatorname == 'nullspace':
+                expr = arg.nullspace()
+            elif operatorname == 'norm':
+                expr = arg.norm()
+            elif operatorname == 'cols':
+                expr = [arg.col(i) for i in range(arg.cols)]
+            elif operatorname == 'rows':
+                expr = [arg.row(i) for i in range(arg.rows)]
+            elif operatorname in ['eig', 'eigen', 'diagonalize']:
+                expr = arg.diagonalize()
+            elif operatorname in ['eigenvals', 'eigenvalues']:
+                expr = arg.eigenvals()
+            elif operatorname in ['eigenvects', 'eigenvectors']:
+                expr = arg.eigenvects()
+            elif operatorname in ['svd', 'SVD']:
+                expr = arg.singular_value_decomposition()
+        elif name in ["log", "ln"]:
+            if func.subexpr():
+                if func.subexpr().atom():
+                    base = convert_atom(func.subexpr().atom())
+                else:
+                    base = convert_expr(func.subexpr().expr())
+            elif name == "log":
+                base = 10
+            elif name == "ln":
+                base = sympy.E
+            expr = sympy.log(arg, base, evaluate=False)
+        elif name in ["exp", "exponentialE"]:
+            expr = sympy.exp(arg)
+        elif name == "floor":
+            expr = handle_floor(arg)
+        elif name == "ceil":
+            expr = handle_ceil(arg)
+        elif name == 'det':
+            expr = arg.det()
+
+        func_pow = None
+        should_pow = True
+        if func.supexpr():
+            if func.supexpr().expr():
+                func_pow = convert_expr(func.supexpr().expr())
+            else:
+                func_pow = convert_atom(func.supexpr().atom())
+
+        if name in ["sin", "cos", "tan", "csc", "sec", "cot", "sinh", "cosh", "tanh"]:
+            if func_pow == -1:
+                name = "a" + name
+                should_pow = False
+            expr = getattr(sympy.functions, name)(arg, evaluate=False)
+
+        if func_pow and should_pow:
+            expr = sympy.Pow(expr, func_pow, evaluate=False)
+
+        return expr
+
+    elif func.func_normal_multi_arg():
+        if func.L_PAREN():  # function called with parenthesis
+            args = func.func_multi_arg().getText().split(",")
+        else:
+            args = func.func_multi_arg_noparens().split(",")
+
+        args = list(map(lambda arg: latex2sympy(arg, VARIABLE_VALUES), args))
+        name = func.func_normal_multi_arg().start.text[1:]
+
+        if name == "operatorname":
+            operatorname = func.func_normal_multi_arg().func_operator_name.getText()
+            if operatorname in ["gcd", "lcm"]:
+                expr = handle_gcd_lcm(operatorname, args)
+            elif operatorname == 'zeros':
+                expr = sympy.zeros(*args)
+            elif operatorname == 'ones':
+                expr = sympy.ones(*args)
+            elif operatorname == 'diag':
+                expr = sympy.diag(*args)
+            elif operatorname == 'hstack':
+                expr = sympy.Matrix.hstack(*args)
+            elif operatorname == 'vstack':
+                expr = sympy.Matrix.vstack(*args)
+            elif operatorname in ['orth', 'ortho', 'orthogonal', 'orthogonalize']:
+                if len(args) == 1:
+                    arg = args[0]
+                    expr = sympy.matrices.GramSchmidt([arg.col(i) for i in range(arg.cols)], True)
+                else:
+                    expr = sympy.matrices.GramSchmidt(args, True)
+        elif name in ["gcd", "lcm"]:
+            expr = handle_gcd_lcm(name, args)
+        elif name in ["max", "min"]:
+            name = name[0].upper() + name[1:]
+            expr = getattr(sympy.functions, name)(*args, evaluate=False)
+
+        func_pow = None
+        should_pow = True
+        if func.supexpr():
+            if func.supexpr().expr():
+                func_pow = convert_expr(func.supexpr().expr())
+            else:
+                func_pow = convert_atom(func.supexpr().atom())
+
+        if func_pow and should_pow:
+            expr = sympy.Pow(expr, func_pow, evaluate=False)
+
+        return expr
+    elif func.atom_expr_no_supexpr():
+        # define a function
+        f = sympy.Function(func.atom_expr_no_supexpr().getText())
+        # args
+        args = func.func_common_args().getText().split(",")
+        if args[-1] == '':
+            args = args[:-1]
+        args = [latex2sympy(arg, VARIABLE_VALUES) for arg in args]
+        # supexpr
+        if func.supexpr():
+            if func.supexpr().expr():
+                expr = convert_expr(func.supexpr().expr())
+            else:
+                expr = convert_atom(func.supexpr().atom())
+            return sympy.Pow(f(*args), expr, evaluate=False)
+        else:
+            return f(*args)
+    elif func.FUNC_INT():
+        return handle_integral(func)
+    elif func.FUNC_SQRT():
+        expr = convert_expr(func.base)
+        if func.root:
+            r = convert_expr(func.root)
+            return sympy.Pow(expr, 1 / r, evaluate=False)
+        else:
+            return sympy.Pow(expr, sympy.S.Half, evaluate=False)
+    elif func.FUNC_SUM():
+        return handle_sum_or_prod(func, "summation")
+    elif func.FUNC_PROD():
+        return handle_sum_or_prod(func, "product")
+    elif func.FUNC_LIM():
+        return handle_limit(func)
+    elif func.EXP_E():
+        return handle_exp(func)
+
+
+def convert_func_arg(arg):
+    if hasattr(arg, 'expr'):
+        return convert_expr(arg.expr())
+    else:
+        return convert_mp(arg.mp_nofunc())
+
+
+def handle_integral(func):
+    if func.additive():
+        integrand = convert_add(func.additive())
+    elif func.frac():
+        integrand = convert_frac(func.frac())
+    else:
+        integrand = 1
+
+    int_var = None
+    if func.DIFFERENTIAL():
+        int_var = get_differential_var(func.DIFFERENTIAL())
+    else:
+        for sym in integrand.atoms(sympy.Symbol):
+            s = str(sym)
+            if len(s) > 1 and s[0] == 'd':
+                if s[1] == '\\':
+                    int_var = sympy.Symbol(s[2:], real=is_real)
+                else:
+                    int_var = sympy.Symbol(s[1:], real=is_real)
+                int_sym = sym
+        if int_var:
+            integrand = integrand.subs(int_sym, 1)
+        else:
+            # Assume dx by default
+            int_var = sympy.Symbol('x', real=is_real)
+
+    if func.subexpr():
+        if func.subexpr().atom():
+            lower = convert_atom(func.subexpr().atom())
+        else:
+            lower = convert_expr(func.subexpr().expr())
+        if func.supexpr().atom():
+            upper = convert_atom(func.supexpr().atom())
+        else:
+            upper = convert_expr(func.supexpr().expr())
+        return sympy.Integral(integrand, (int_var, lower, upper))
+    else:
+        return sympy.Integral(integrand, int_var)
+
+
+def handle_sum_or_prod(func, name):
+    val = convert_mp(func.mp())
+    iter_var = convert_expr(func.subeq().equality().expr(0))
+    start = convert_expr(func.subeq().equality().expr(1))
+    if func.supexpr().expr():  # ^{expr}
+        end = convert_expr(func.supexpr().expr())
+    else:  # ^atom
+        end = convert_atom(func.supexpr().atom())
+
+    if name == "summation":
+        return sympy.Sum(val, (iter_var, start, end))
+    elif name == "product":
+        return sympy.Product(val, (iter_var, start, end))
+
+
+def handle_limit(func):
+    sub = func.limit_sub()
+    if sub.LETTER_NO_E():
+        var = sympy.Symbol(sub.LETTER_NO_E().getText(), real=is_real)
+    elif sub.GREEK_CMD():
+        var = sympy.Symbol(sub.GREEK_CMD().getText()[1:].strip(), real=is_real)
+    elif sub.OTHER_SYMBOL_CMD():
+        var = sympy.Symbol(sub.OTHER_SYMBOL_CMD().getText().strip(), real=is_real)
+    else:
+        var = sympy.Symbol('x', real=is_real)
+    if sub.SUB():
+        direction = "-"
+    else:
+        direction = "+"
+    approaching = convert_expr(sub.expr())
+    content = convert_mp(func.mp())
+
+    return sympy.Limit(content, var, approaching, direction)
+
+
+def handle_exp(func):
+    if func.supexpr():
+        if func.supexpr().expr():  # ^{expr}
+            exp_arg = convert_expr(func.supexpr().expr())
+        else:  # ^atom
+            exp_arg = convert_atom(func.supexpr().atom())
+    else:
+        exp_arg = 1
+    return sympy.exp(exp_arg)
+
+
+def handle_gcd_lcm(f, args):
+    """
+    Return the result of gcd() or lcm(), as UnevaluatedExpr
+
+    f: str - name of function ("gcd" or "lcm")
+    args: List[Expr] - list of function arguments
+    """
+
+    args = tuple(map(sympy.nsimplify, args))
+
+    # gcd() and lcm() don't support evaluate=False
+    return sympy.UnevaluatedExpr(getattr(sympy, f)(args))
+
+
+def handle_floor(expr):
+    """
+    Apply floor() then return the floored expression.
+
+    expr: Expr - sympy expression as an argument to floor()
+    """
+    return sympy.functions.floor(expr, evaluate=False)
+
+
+def handle_ceil(expr):
+    """
+    Apply ceil() then return the ceil-ed expression.
+
+    expr: Expr - sympy expression as an argument to ceil()
+    """
+    return sympy.functions.ceiling(expr, evaluate=False)
+
+
+def get_differential_var(d):
+    text = get_differential_var_str(d.getText())
+    return sympy.Symbol(text, real=is_real)
+
+
+def get_differential_var_str(text):
+    for i in range(1, len(text)):
+        c = text[i]
+        if not (c == " " or c == "\r" or c == "\n" or c == "\t"):
+            idx = i
+            break
+    text = text[idx:]
+    if text[0] == "\\":
+        text = text[1:]
+    return text
+
+
+def latex(tex):
+    global frac_type
+    result = sympy.latex(tex)
+    result = result.replace(r'\frac', frac_type, -1).replace(r'\dfrac', frac_type, -1).replace(r'\tfrac', frac_type, -1)
+    result = result.replace(r'\left[\begin{matrix}', r'\begin{bmatrix}', -1).replace(r'\end{matrix}\right]', r'\end{bmatrix}', -1)
+    result = result.replace(r'\left', r'', -1).replace(r'\right', r'', -1)
+    result = result.replace(r' )', r')', -1)
+    result = result.replace(r'\log', r'\ln', -1)
+    return result
+
+
+def latex2latex(tex):
+    result = latex2sympy(tex)
+    # if result is a list or tuple or dict
+    if isinstance(result, list) or isinstance(result, tuple) or isinstance(result, dict):
+        return latex(result)
+    else:
+        return latex(simplify(result.subs(variances).doit().doit()))
+
+
+# Set image value
+latex2latex('i=I')
+latex2latex('j=I')
+# set Identity(i)
+for i in range(1, 10):
+    lh = sympy.Symbol(r'\bm{I}_' + str(i), real=False)
+    lh_m = sympy.MatrixSymbol(r'\bm{I}_' + str(i), i, i)
+    rh = sympy.Identity(i).as_mutable()
+    variances[lh] = rh
+    variances[lh_m] = rh
+    var[str(lh)] = rh
+
+if __name__ == '__main__':
+    # latex2latex(r'A_1=\begin{bmatrix}1 & 2 & 3 & 4 \\ 5 & 6 & 7 & 8\end{bmatrix}')
+    # latex2latex(r'b_1=\begin{bmatrix}1 \\ 2 \\ 3 \\ 4\end{bmatrix}')
+    # tex = r"(x+2)|_{x=y+1}"
+    # tex = r"\operatorname{zeros}(3)"
+    tex = r"\operatorname{rows}(\begin{bmatrix}1 & 2 \\ 3 & 4\end{bmatrix})"
+    # print("latex2latex:", latex2latex(tex))
+    math = latex2sympy(tex)
+    # math = math.subs(variances)
+    print("latex:", tex)
+    # print("var:", variances)
+    print("raw_math:", math)
+    # print("math:", latex(math.doit()))
+    # print("math_type:", type(math.doit()))
+    # print("shape:", (math.doit()).shape)
+    print("cal:", latex2latex(tex))

latex2sympy/requirements.in

@@ -0,0 +1,2 @@
+sympy
+antlr4-python3-runtime

latex2sympy/requirements.txt

@@ -0,0 +1,12 @@
+#
+# This file is autogenerated by pip-compile with Python 3.10
+# by the following command:
+#
+#    pip-compile requirements.in
+#
+antlr4-python3-runtime==4.11.1
+    # via -r requirements.in
+mpmath==1.3.0
+    # via sympy
+sympy==1.12
+    # via -r requirements.in

latex2sympy/sandbox/linalg_equations.py

@@ -0,0 +1,10 @@
+from latex2sympy import process_sympy
+import sys
+sys.path.append("..")
+
+# latex = "2\\begin{pmatrix}1&1&1\\\\0&1&1\\\\0&0&1\\end{pmatrix}\\begin{pmatrix}1&1&1\\\\0&1&1\\\\0&0&1\\end{pmatrix}"
+latex = "\\frac{a^{2} \\left(3 \\pi - 4 \\sin{\\left(\\pi \\right)} + \\frac{\\sin{\\left(2 \\pi \\right)}}{2}\\right)}{2}"
+math = process_sympy(latex)
+
+print(type(math))
+print("latex: %s to math: %s" % (latex, math))

latex2sympy/sandbox/linalg_span.py

@@ -0,0 +1,19 @@
+from latex2sympy import process_sympy
+import sys
+sys.path.append("..")
+
+latex = "\\begin{pmatrix}1\\\\2\\\\3\\end{pmatrix}"
+math = process_sympy(latex)
+print("latex: %s to math: %s" % (latex, math))
+
+latex = "\\begin{pmatrix}1\\\\2\\\\3\\end{pmatrix},\\begin{pmatrix}4\\\\3\\\\1\\end{pmatrix}"
+math = process_sympy(latex)
+print("latex: %s to math: %s" % (latex, math))
+
+latex = "[\\begin{pmatrix}1\\\\2\\\\3\\end{pmatrix},\\begin{pmatrix}4\\\\3\\\\1\\end{pmatrix}]"
+math = process_sympy(latex)
+print("latex: %s to math: %s" % (latex, math))
+
+latex = "\\left\\{\\begin{pmatrix}1\\\\2\\\\3\\end{pmatrix},\\begin{pmatrix}4\\\\3\\\\1\\end{pmatrix}\\right\\}"
+math = process_sympy(latex)
+print("latex: %s to math: %s" % (latex, math))

latex2sympy/sandbox/matrix.py

@@ -0,0 +1,46 @@
+from latex2sympy import process_sympy
+from sympy import *
+import sys
+sys.path.append("..")
+
+theta = Symbol('theta', real=True)
+
+latex = "\\begin{matrix}1&2\\\\3&4\\end{matrix}"
+math = process_sympy(latex)
+print("latex: %s to math: %s" % (latex, math))
+
+latex = "\\begin{matrix}1&2\\\\3&4\\\\5&6\\end{matrix}"
+math = process_sympy(latex)
+print("latex: %s to math: %s" % (latex, math))
+
+latex = "\\begin{matrix}1&2&3\\\\4&5&6\\\\7&8&9\\end{matrix}"
+math = process_sympy(latex)
+print("latex: %s to math: %s" % (latex, math))
+
+latex = "\\begin{matrix}x^1&x^2&x^3\\\\y^1&y^2&y^3\\\\z^1&z^2&z^3\\end{matrix}"
+math = process_sympy(latex)
+print("latex: %s to math: %s" % (latex, math))
+
+latex = "\\begin{matrix}x\\\\y\\end{matrix}"
+math = process_sympy(latex)
+print("latex: %s to math: %s" % (latex, math))
+
+latex = "2\\cdot\\begin{matrix}x\\\\y\\end{matrix}"
+math = process_sympy(latex)
+print("latex: %s to math: %s" % (latex, math))
+
+latex = "2\\cdot\\begin{matrix}x\\\\y\\end{matrix} + \\begin{matrix}2\\\\3\\end{matrix}"
+math = process_sympy(latex)
+print("latex: %s to math: %s" % (latex, math))
+
+latex = "-2\\begin{matrix}1&2\\\\3&4\\end{matrix}"
+math = process_sympy(latex)
+print("latex: %s to math: %s" % (latex, math))
+
+latex = "2\\cdot\\theta\\begin{matrix}x\\\\y\\end{matrix} + \\begin{matrix}2\\\\3\\end{matrix}"
+math = process_sympy(latex)
+print("latex: %s to math: %s" % (latex, math))
+
+latex = "\\theta\\begin{matrix}1\\\\3\\end{matrix} - \\begin{matrix}-1\\\\2\\end{matrix}"
+math = process_sympy(latex)
+print("latex: %s to math: %s" % (latex, math))