/usr/include/octave-4.2.2/octave/pt-exp.h is in liboctave-dev 4.2.2-1ubuntu1.
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 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 | /*
Copyright (C) 1996-2017 John W. Eaton
This file is part of Octave.
Octave is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 3 of the License, or (at your
option) any later version.
Octave 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 Octave; see the file COPYING. If not, see
<http://www.gnu.org/licenses/>.
*/
#if ! defined (octave_pt_exp_h)
#define octave_pt_exp_h 1
#include "octave-config.h"
#include <string>
#include <list>
class octave_value;
class octave_lvalue;
#include "pt.h"
#include "symtab.h"
// A base class for expressions.
class
tree_expression : public tree
{
public:
tree_expression (int l = -1, int c = -1)
: tree (l, c), num_parens (0), postfix_index_type ('\0'),
for_cmd_expr (false), print_flag (false) { }
virtual ~tree_expression (void) { }
virtual bool has_magic_end (void) const = 0;
virtual tree_expression *dup (symbol_table::scope_id,
symbol_table::context_id context) const = 0;
virtual bool is_constant (void) const { return false; }
virtual bool is_matrix (void) const { return false; }
virtual bool is_cell (void) const { return false; }
virtual bool is_identifier (void) const { return false; }
virtual bool is_index_expression (void) const { return false; }
virtual bool is_assignment_expression (void) const { return false; }
virtual bool is_prefix_expression (void) const { return false; }
virtual bool is_unary_expression (void) const { return false; }
virtual bool is_binary_expression (void) const { return false; }
virtual bool is_boolean_expression (void) const { return false; }
virtual bool is_logically_true (const char *);
virtual bool lvalue_ok (void) const { return false; }
virtual bool rvalue_ok (void) const { return false; }
virtual octave_value rvalue1 (int nargout = 1);
virtual octave_value_list rvalue (int nargout);
virtual octave_value_list
rvalue (int nargout, const std::list<octave_lvalue> *lvalue_list);
virtual octave_lvalue lvalue (void);
int paren_count (void) const { return num_parens; }
bool is_postfix_indexed (void) const { return (postfix_index_type != '\0'); }
char postfix_index (void) const { return postfix_index_type; }
// Check if the result of the expression should be printed.
// Should normally be used in conjunction with
// octave::tree_evaluator::statement_printing_enabled.
bool print_result (void) const { return print_flag; }
virtual std::string oper (void) const { return "<unknown>"; }
virtual std::string name (void) const { return "<unknown>"; }
virtual std::string original_text (void) const;
virtual void mark_braindead_shortcircuit (void) { }
void mark_as_for_cmd_expr (void) { for_cmd_expr = true; }
bool is_for_cmd_expr (void) const { return for_cmd_expr; }
tree_expression *mark_in_parens (void)
{
num_parens++;
return this;
}
tree_expression *set_postfix_index (char type)
{
postfix_index_type = type;
return this;
}
tree_expression *set_print_flag (bool print)
{
print_flag = print;
return this;
}
virtual void copy_base (const tree_expression& e)
{
num_parens = e.num_parens;
postfix_index_type = e.postfix_index_type;
print_flag = e.print_flag;
}
protected:
// A count of the number of times this expression appears directly
// inside a set of parentheses.
//
// (((e1)) + e2) ==> 2 for expression e1
// ==> 1 for expression ((e1)) + e2
// ==> 0 for expression e2
int num_parens;
// The first index type associated with this expression. This field
// is 0 (character '\0') if the expression has no associated index.
// See the code in tree_identifier::rvalue for the rationale.
char postfix_index_type;
// TRUE if this expression is the EXPR in for loop:
// FOR i = EXPR ... END
bool for_cmd_expr;
// Print result of rvalue for this expression?
bool print_flag;
private:
// No copying!
tree_expression (const tree_expression&);
tree_expression& operator = (const tree_expression&);
};
#endif
|