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
|
#pragma once
#include <vector>
#include <utility>
#include <sstream>
#include <unordered_map>
#include "grammar.hh"
#include "util.hh"
#include "weaver.hh"
using namespace std;
typedef pair<size_t,size_t> Span;
namespace std {
template <>
struct hash<Span>
{
size_t
operator()(Span const& k) const
{
return ((hash<size_t>()(k.first)
^ (hash<size_t>()(k.second) << 1)) >> 1);
}
};
}
namespace Parse {
void visit(vector<Span>& p,
size_t i, size_t l, size_t r, size_t x=0)
{
for (size_t span = i; span <= r-x; span++) {
for (size_t k = l; k <= r-span; k++) {
p.push_back(Span(k,k+span));
}
}
}
struct ChartItem
{
Span span;
G::Rule const* rule;
vector<ChartItem*> tails;
size_t dot;
ChartItem(G::Rule* r)
{
rule = r;
dot = 0;
}
ChartItem(ChartItem const& o)
{
span.first = o.span.first;
span.second = o.span.second;
rule = o.rule;
for (auto it: o.tails)
tails.push_back(it);
dot = o.dot;
}
};
struct Chart
{
size_t n_;
unordered_map<Span, vector<ChartItem*> > m_;
unordered_map<string,bool> b_;
vector<ChartItem*>& at(Span s)
{
return m_[s];
}
string h(ChartItem* item, Span s)
{
ostringstream ss;
item->rule->lhs->symbol();
ss << s.first;
ss << s.second;
return ss.str();
}
void add(ChartItem* item, Span s)
{
m_[s].push_back(item);
b_[h(item, s)] = true;
}
Chart(size_t n)
{
}
};
void
init(vector<symbol_t> const& in, size_t n, Chart& active, Chart& passive, G::Grammar const& g)
{
for (auto rule: g.rules) {
cout << *rule << endl;
}
}
} //
|
