lean2/src/frontends/lean/parse_rewrite_tactic.cpp

227 lines
8 KiB
C++
Raw Normal View History

/*
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
*/
#include "library/tactic/rewrite_tactic.h"
#include "frontends/lean/parser.h"
#include "frontends/lean/tokens.h"
#include "frontends/lean/parse_tactic_location.h"
namespace lean {
static optional<expr> parse_pattern(parser & p) {
if (p.curr_is_token(get_lcurly_tk())) {
p.next();
expr r = p.parse_tactic_expr_arg();
p.check_token_next(get_rcurly_tk(), "invalid rewrite pattern, '}' expected");
return some_expr(r);
} else {
return none_expr();
}
}
static expr parse_rule(parser & p, bool use_paren) {
if (use_paren) {
if (p.curr_is_token(get_lparen_tk())) {
p.next();
expr r = p.parse_tactic_expr_arg();
p.check_token_next(get_rparen_tk(), "invalid rewrite pattern, ')' expected");
return r;
} else {
return p.parse_tactic_id_arg();
}
} else {
return p.parse_tactic_expr_arg();
}
}
static void check_not_in_theorem_queue(parser & p, name const & n, pos_info const & pos) {
if (p.in_theorem_queue(n)) {
throw parser_error(sstream() << "invalid 'rewrite' tactic, cannot unfold '" << n << "' "
<< "which is still in the theorem queue. Use command 'reveal " << n << "' "
<< "to access its definition.", pos);
}
}
static expr parse_rewrite_unfold_core(parser & p, bool force_unfold) {
buffer<name> to_unfold;
if (p.curr_is_token(get_lbracket_tk())) {
p.next();
while (true) {
auto pos = p.pos();
to_unfold.push_back(p.check_constant_next("invalid unfold rewrite step, identifier expected"));
check_not_in_theorem_queue(p, to_unfold.back(), pos);
if (!p.curr_is_token(get_comma_tk()))
break;
p.next();
}
p.check_token_next(get_rbracket_tk(), "invalid unfold rewrite step, ',' or ']' expected");
} else {
auto pos = p.pos();
to_unfold.push_back(p.check_constant_next("invalid unfold rewrite step, identifier or '[' expected"));
check_not_in_theorem_queue(p, to_unfold.back(), pos);
}
location loc = parse_tactic_location(p);
return mk_rewrite_unfold(to_list(to_unfold), force_unfold, loc);
}
static expr parse_rewrite_unfold(parser & p, bool force_unfold) {
lean_assert(p.curr_is_token(get_up_tk()) || p.curr_is_token(get_caret_tk()));
p.next();
return parse_rewrite_unfold_core(p, force_unfold);
}
// If use_paren is true, then lemmas must be identifiers or be wrapped with parenthesis
static expr parse_rewrite_element(parser & p, bool use_paren) {
if (p.curr_is_token(get_up_tk()) || p.curr_is_token(get_caret_tk())) {
bool force_unfold = true;
return parse_rewrite_unfold(p, force_unfold);
}
if (p.curr_is_token(get_down_tk())) {
p.next();
expr e = p.parse_tactic_expr_arg();
location loc = parse_tactic_location(p);
return mk_rewrite_fold(e, loc);
}
bool symm = false;
if (p.curr_is_token(get_sub_tk())) {
p.next();
symm = true;
}
if (p.curr_is_numeral()) {
unsigned n = p.parse_small_nat();
if (p.curr_is_token(get_greater_tk())) {
p.next();
optional<expr> pat = parse_pattern(p);
expr H = parse_rule(p, use_paren);
location loc = parse_tactic_location(p);
return mk_rewrite_at_most_n(pat, H, symm, n, loc);
} else {
optional<expr> pat = parse_pattern(p);
expr H = parse_rule(p, use_paren);
location loc = parse_tactic_location(p);
return mk_rewrite_exactly_n(pat, H, symm, n, loc);
}
} else if (p.curr_is_token(get_star_tk())) {
p.next();
optional<expr> pat = parse_pattern(p);
expr H = parse_rule(p, use_paren);
location loc = parse_tactic_location(p);
return mk_rewrite_zero_or_more(pat, H, symm, loc);
} else if (p.curr_is_token(get_plus_tk())) {
p.next();
optional<expr> pat = parse_pattern(p);
expr H = parse_rule(p, use_paren);
location loc = parse_tactic_location(p);
return mk_rewrite_one_or_more(pat, H, symm, loc);
} else if (p.curr_is_token(get_triangle_tk()) || p.curr_is_token(get_greater_tk())) {
p.next();
if (p.curr_is_token(get_star_tk())) {
p.next();
location loc = parse_tactic_location(p);
return mk_rewrite_reduce(loc);
} else {
expr e = p.parse_tactic_expr_arg();
location loc = parse_tactic_location(p);
return mk_rewrite_reduce_to(e, loc);
}
} else {
optional<expr> pat = parse_pattern(p);
expr H = parse_rule(p, use_paren);
location loc = parse_tactic_location(p);
return mk_rewrite_once(pat, H, symm, loc);
}
}
void parse_rewrite_tactic_elems(parser & p, buffer<expr> & elems) {
if (p.curr_is_token(get_lbracket_tk())) {
p.next();
while (!p.curr_is_token(get_rbracket_tk())) {
auto pos = p.pos();
elems.push_back(p.save_pos(parse_rewrite_element(p, false), pos));
if (!p.curr_is_token(get_comma_tk()))
break;
p.next();
}
p.next();
} else {
auto pos = p.pos();
elems.push_back(p.save_pos(parse_rewrite_element(p, true), pos));
}
}
expr parse_rewrite_tactic(parser & p) {
buffer<expr> elems;
parse_rewrite_tactic_elems(p, elems);
return mk_rewrite_tactic_expr(elems);
}
expr parse_xrewrite_tactic(parser & p) {
buffer<expr> elems;
parse_rewrite_tactic_elems(p, elems);
return mk_xrewrite_tactic_expr(elems);
}
expr parse_krewrite_tactic(parser & p) {
buffer<expr> elems;
parse_rewrite_tactic_elems(p, elems);
return mk_krewrite_tactic_expr(elems);
}
expr parse_esimp_tactic(parser & p) {
buffer<expr> elems;
auto pos = p.pos();
bool force_unfold = false;
if (p.curr_is_token(get_up_tk()) || p.curr_is_token(get_caret_tk())) {
elems.push_back(p.save_pos(parse_rewrite_unfold(p, force_unfold), pos));
} else if (p.curr_is_token(get_lbracket_tk())) {
elems.push_back(p.save_pos(parse_rewrite_unfold_core(p, force_unfold), pos));
} else {
location loc = parse_tactic_location(p);
elems.push_back(p.save_pos(mk_rewrite_reduce(loc), pos));
}
return mk_rewrite_tactic_expr(elems);
}
expr parse_unfold_tactic(parser & p) {
buffer<expr> elems;
auto pos = p.pos();
bool force_unfold = true;
if (p.curr_is_identifier()) {
name c = p.check_constant_next("invalid unfold tactic, identifier expected");
check_not_in_theorem_queue(p, c, pos);
location loc = parse_tactic_location(p);
elems.push_back(p.save_pos(mk_rewrite_unfold(to_list(c), force_unfold, loc), pos));
} else if (p.curr_is_token(get_lbracket_tk())) {
elems.push_back(p.save_pos(parse_rewrite_unfold_core(p, force_unfold), pos));
} else {
throw parser_error("invalid unfold tactic, identifier or `[` expected", pos);
}
return mk_rewrite_tactic_expr(elems);
}
expr parse_fold_tactic(parser & p) {
buffer<expr> elems;
auto pos = p.pos();
if (p.curr_is_token(get_lbracket_tk())) {
p.next();
while (true) {
auto pos = p.pos();
expr e = p.parse_tactic_expr_arg();
location loc = parse_tactic_location(p);
elems.push_back(p.save_pos(mk_rewrite_fold(e, loc), pos));
if (!p.curr_is_token(get_comma_tk()))
break;
p.next();
}
p.check_token_next(get_rbracket_tk(), "invalid 'fold' tactic, ',' or ']' expected");
} else {
expr e = p.parse_tactic_expr_arg();
location loc = parse_tactic_location(p);
elems.push_back(p.save_pos(mk_rewrite_fold(e, loc), pos));;
}
return mk_rewrite_tactic_expr(elems);
}
}