traxys/tree-sitter
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Make ordering of cases deterministic in generated parsers

Browse source
This commit is contained in:
Max Brunsfeld 2014-02-10 18:38:01 -08:00
parent 8baa1396fd
commit 15c9e2d398
12 changed files with 369 additions and 348 deletions
Download patch file Download diff file Expand all files Collapse all files

16
src/compiler/lex_table.cpp
View file

@ -2,8 +2,8 @@
using std::string;
using std::to_string;
using std::unordered_map;
using std::unordered_set;
using std::map;
using std::set;
using tree_sitter::rules::Symbol;
using tree_sitter::rules::CharacterSet;
@ -33,6 +33,14 @@ namespace tree_sitter {
(symbol == other.symbol);
}
bool LexAction::operator<(const LexAction &other) const {
if (type < other.type) return true;
if (type > other.type) return false;
if (state_index < other.state_index) return true;
if (state_index > other.state_index) return false;
return (symbol < other.symbol);
}
std::ostream& operator<<(std::ostream &stream, const LexAction &action) {
switch (action.type) {
case LexActionTypeError:
@ -45,8 +53,8 @@ namespace tree_sitter {
}
// State
unordered_set<CharacterSet> LexState::expected_inputs() const {
unordered_set<CharacterSet> result;
set<CharacterSet> LexState::expected_inputs() const {
set<CharacterSet> result;
for (auto pair : actions)
result.insert(pair.first);
return result;