blob: ec6fc147a5b6f8622fda4494f9c5a2aab0a4018b (
plain)
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
|
/***********************************************************************
Moses - statistical machine translation system
Copyright (C) 2006-2011 University of Edinburgh
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
***********************************************************************/
#pragma once
#ifndef EXTRACT_GHKM_PARSE_TREE_H_
#define EXTRACT_GHKM_PARSE_TREE_H_
#include <string>
#include <vector>
namespace Moses {
namespace GHKM {
class ParseTree
{
public:
ParseTree(const std::string &label)
: m_label(label)
, m_children()
, m_parent() {}
~ParseTree();
const std::string &GetLabel() const { return m_label; }
const std::vector<ParseTree*> &GetChildren() const { return m_children; }
const ParseTree *GetParent() const { return m_parent; }
void SetParent(ParseTree *);
void SetChildren(const std::vector<ParseTree*> &);
void AddChild(ParseTree *);
bool IsLeaf() const;
template<typename OutputIterator>
void GetLeaves(OutputIterator);
private:
// Disallow copying
ParseTree(const ParseTree &);
ParseTree &operator=(const ParseTree &);
std::string m_label;
std::vector<ParseTree*> m_children;
ParseTree *m_parent;
};
template<typename OutputIterator>
void ParseTree::GetLeaves(OutputIterator result)
{
if (IsLeaf()) {
*result++ = this;
} else {
std::vector<ParseTree *>::const_iterator p = m_children.begin();
std::vector<ParseTree *>::const_iterator end = m_children.end();
while (p != end) {
ParseTree &child = **p++;
child.GetLeaves(result);
}
}
}
} // namespace GHKM
} // namespace Moses
#endif
|