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
|
////////////////////////////////////////////////////////////////////////
//
// Copyright (C) 2019-2021 The Octave Project Developers
//
// See the file COPYRIGHT.md in the top-level directory of this
// distribution or <https://octave.org/copyright/>.
//
// 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
// <https://www.gnu.org/licenses/>.
//
////////////////////////////////////////////////////////////////////////
#if ! defined (octave_anon_fcn_validator_h)
#define octave_anon_fcn_validator_h 1
#include "octave-config.h"
#include <string>
#include "pt-walk.h"
namespace octave
{
class tree_expression;
class tree_parameter_list;
// How to check the semantics of the code that the parse trees represent.
class anon_fcn_validator : public tree_walker
{
public:
anon_fcn_validator (tree_parameter_list *, tree_expression *expr);
// No copying!
anon_fcn_validator (const anon_fcn_validator&) = delete;
anon_fcn_validator& operator = (const anon_fcn_validator&) = delete;
~anon_fcn_validator (void) = default;
void visit_postfix_expression (tree_postfix_expression&);
void visit_prefix_expression (tree_prefix_expression&);
void visit_multi_assignment (tree_multi_assignment&);
void visit_simple_assignment (tree_simple_assignment&);
bool ok (void) const { return m_ok; }
int line (void) const { return m_line; }
int column (void) const { return m_column; }
std::string message (void) const { return m_message; }
private:
bool m_ok;
int m_line;
int m_column;
std::string m_message;
void error (tree_expression& expr);
};
}
#endif
|
