/usr/include/ladr/parse.h is in libladr-dev 0.0.200911a-2.1build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 | /* Copyright (C) 2006, 2007 William McCune
This file is part of the LADR Deduction Library.
The LADR Deduction Library is free software; you can redistribute it
and/or modify it under the terms of the GNU General Public License,
version 2.
The LADR Deduction Library is distributed in the hope that it will be
useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with the LADR Deduction Library; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#ifndef TP_PARSE_H
#define TP_PARSE_H
#include "listterm.h"
/* INTRODUCTION
This package has routines for reading and writing terms in
human-readable form. Binary function symbols can be declared
to be infix with a precedence and left or right association,
so that many parentheses can be omitted. Unary symbols
can be declared to be prefix or postfix.
In addition, prolog-style list-notation and quantified formulas are
supported.
<P>
The symbol declarations and parse rules are similar to the method
used by many Prolog systems (although we use mnemonic names
instead of xfy, yfx, yf, etc.). The symbol declarations
are made with set_parse_type().
<P>
This package is based on code taked form Otter and EQP, but there
are some important differences. Detailed documentation should
be available elsewhere.
<P>
The intension is to use this package for reading
and writing all types of data (terms, clauses, formulas, control
information, etc.), with outside routines to translate to/from
the appropriate internal data structure when necessary.
*/
/* Public definitions */
/* End of public definitions */
/* Public function prototypes from parse.c */
void fprint_parse_mem(FILE *fp, BOOL heading);
void p_parse_mem(void);
void translate_neg_equalities(BOOL flag);
BOOL ordinary_constant_string(char *s);
Term sread_term(String_buf sb, FILE *fout);
Term read_term(FILE *fin, FILE *fout);
Term parse_term_from_string(char *s);
void sb_write_term(String_buf sb, Term t);
void fwrite_term(FILE *fp, Term t);
void fwrite_term_nl(FILE *fp, Term t);
char *process_quoted_symbol(char *str);
void declare_parse_type(char *str, int precedence, Parsetype type);
void declare_quantifier_precedence(int prec);
void declare_standard_parse_types(void);
BOOL redeclare_symbol_and_copy_parsetype(char *operation, char *str,
BOOL echo, FILE *fout);
void skip_to_nl(FILE *fp);
Plist split_string(char *onlys);
void set_cons_char(char c);
char get_cons_char(void);
void set_quote_char(char c);
char get_quote_char(void);
void parenthesize(BOOL setting);
void check_for_illegal_symbols(BOOL setting);
void simple_parse(BOOL setting);
#endif /* conditional compilation of whole file */
|