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
|
#ifndef _INCLUDED_SRCONFLICT_
#define _INCLUDED_SRCONFLICT_
#include <iosfwd>
#include <vector>
#include "../rmreduction/rmreduction.h"
#include "../next/next.h"
class Rules;
class SRConflict
{
friend std::ostream &operator<<(std::ostream &out,
SRConflict const &conflict);
Next::Vector const &d_nextVector; // the Next objects describing
// states to transit to
StateItem::Vector const &d_itemVector; // the items which have S/R
// conflicts with the
// reducible items
std::vector<size_t> const &d_reducible; // the indices of the
// reducible rules
RmReduction::Vector d_rmReduction; // Vector of reducible rules
// to remove for this conflict
RmShift::Vector d_rmShift; // vector of indices of items
// having shift conflicts that
// are removed
size_t d_lastItemIdx; // used in handlesrconflict.cc
size_t d_lastNext;
static size_t s_nConflicts; // the number of S/R conflicts
// that could not be solved by
// preference/association
// decisions.
public:
SRConflict(Next::Vector const &next,
StateItem::Vector const &stateItem,
std::vector<size_t> const &reducible);
void inspect();
// returns # of shifts that were removed
size_t removeShifts(Next::Vector &nextVector);
void removeReductions(StateItem::Vector &itemVector);
static size_t nConflicts();
void showConflicts(Rules const &rules) const;
private:
std::ostream &insert(std::ostream &out) const;
void processShiftReduceConflict(Next::ConstIter const &next,
size_t itemIdx);
void handleSRconflict(Next::ConstIter const &next,
size_t reducibleItemIdx);
void visitReduction(size_t idx);
};
inline size_t SRConflict::nConflicts()
{
return s_nConflicts;
}
inline std::ostream &operator<<(std::ostream &out, SRConflict const &conflict)
{
return conflict.insert(out);
}
#endif
|
