#

# Copyright 2020, Data61, CSIRO (ABN 41 687 119 230)

#

# SPDX-License-Identifier: BSD-2-Clause

#

# toplevel graph-refine script

# usage: python graph-refine.py <target> <proofs>

import syntax

import pseudo_compile

import solver

import rep_graph

import problem

import check

import search

import logic

from target_objects import pairings, functions

from target_objects import trace, tracer, printout

import target_objects

import re

import random

import traceback

import time

#import diagnostic

import sys

if __name__ == '__main__':

args = target_objects.load_target_args ()

def toplevel_check (pair, check_loops = True, report = False, count = None,

return str (result)

word_re = re.compile('\\w+')

def name_search (s, tags = None):

return None

def check_search (s, tags = None, report_mode = False,

check_loops = check_loops)

def problem_search (s):

pair = name_search (s)

print pair.name

return check.build_problem (pair)

# somewhat arbitrary assignment of return codes to outcomes.

# larger numbers are (roughly) worse outcomes.

# key categories are success, skipped (not in covered cases), and failure

result_codes = {

}

def comb_results (r1, r2):

(_, r) = max ([(result_codes[r], r) for r in [r1, r2]])

return r

def check_pairs (pairs, loops = True, report_mode = False,

+ [r for (_, r) in results])

def print_coverage_report (skipped_pairs, covered_pairs):

pass

def check_all (omit_set = set (), loops = True, tags = None,

return r

def check_division_pairs (num, denom, loops = True, report_mode = False):

return check_pairs (division, loops = loops, report_mode = report_mode)

def check_deps (fname, report_mode = False):

return check_pairs (pairs, report_mode = report_mode)

def save_compiled_funcs (fname):

out.close ()

def rerun_set (vs):

return ' '.join (strs)

def main (args):

return result

if __name__ == '__main__':

result = main (args)

(code, category) = result_codes[result]

sys.exit (0)