69 lines
1.7 KiB
C++
69 lines
1.7 KiB
C++
#ifndef COMPILER_BUILD_TABLES_PARSE_ITEM_H_
|
|
#define COMPILER_BUILD_TABLES_PARSE_ITEM_H_
|
|
|
|
#include <map>
|
|
#include <utility>
|
|
#include "compiler/build_tables/lookahead_set.h"
|
|
#include "compiler/rules/symbol.h"
|
|
#include "compiler/rules/metadata.h"
|
|
#include "compiler/syntax_grammar.h"
|
|
#include "compiler/precedence_range.h"
|
|
|
|
namespace tree_sitter {
|
|
namespace build_tables {
|
|
|
|
class ParseItem {
|
|
public:
|
|
ParseItem();
|
|
ParseItem(const rules::Symbol &, const Production &, unsigned int);
|
|
|
|
struct CompletionStatus {
|
|
bool is_done;
|
|
int precedence;
|
|
rules::Associativity associativity;
|
|
};
|
|
|
|
bool operator==(const ParseItem &other) const;
|
|
bool operator<(const ParseItem &other) const;
|
|
rules::Symbol lhs() const;
|
|
rules::Symbol next_symbol() const;
|
|
int precedence() const;
|
|
rules::Associativity associativity() const;
|
|
CompletionStatus completion_status() const;
|
|
|
|
int variable_index;
|
|
const Production *production;
|
|
unsigned int step_index;
|
|
};
|
|
|
|
class ParseItemSet {
|
|
public:
|
|
ParseItemSet();
|
|
explicit ParseItemSet(const std::map<ParseItem, LookaheadSet> &);
|
|
|
|
typedef std::map<rules::Symbol, std::pair<ParseItemSet, PrecedenceRange>>
|
|
TransitionMap;
|
|
|
|
TransitionMap transitions() const;
|
|
bool operator==(const ParseItemSet &) const;
|
|
void add(const ParseItemSet &);
|
|
size_t unfinished_item_signature() const;
|
|
|
|
std::map<ParseItem, LookaheadSet> entries;
|
|
};
|
|
|
|
} // namespace build_tables
|
|
} // namespace tree_sitter
|
|
|
|
namespace std {
|
|
|
|
using tree_sitter::build_tables::ParseItemSet;
|
|
|
|
template <>
|
|
struct hash<tree_sitter::build_tables::ParseItemSet> {
|
|
size_t operator()(const ParseItemSet &item_set) const;
|
|
};
|
|
|
|
} // namespace std
|
|
|
|
#endif // COMPILER_BUILD_TABLES_PARSE_ITEM_H_
|