tree-sitter/src/compiler/lr/item_set.cpp

#include "item_set.h"

#include <iostream>

using namespace std;

namespace tree_sitter {
    namespace lr {
        ItemSet::ItemSet(const vector<Item> &items) : contents(items) {}
        ItemSet::ItemSet(const initializer_list<Item> &items) : contents(items) {}

        static bool vector_contains(vector<Item> items, lr::Item item) {
            return (std::find(items.begin(), items.end(), item) != items.end());
        }
        
        static void add_item(vector<Item> &vector, const Item &item, const Grammar &grammar) {
            if (!vector_contains(vector, item)) {
                vector.push_back(item);
                for (rules::sym_ptr rule : item.next_symbols()) {
                    Item next_item = Item::at_beginning_of_rule(rule->name, grammar);
                    add_item(vector, next_item, grammar);
                }
            }
        }
        
        static vector<Item> closure_in_grammar(const Item &item, const Grammar &grammar) {
            vector<Item> result;
            add_item(result, item, grammar);
            return result;
        }
        
        ItemSet::ItemSet(const Item &item, const Grammar &grammar) : contents(closure_in_grammar(item, grammar)) {}
        
        TransitionMap<ItemSet> ItemSet::char_transitions(const Grammar &grammar) const {
            auto result = TransitionMap<ItemSet>();
            for (auto item : *this) {
                auto new_set = item.transitions()
                .where([&](const rules::rule_ptr &on_rule) -> bool {
                    return typeid(*on_rule) != typeid(rules::Symbol);
                })
                .map<ItemSet>([&](const item_ptr &item) -> item_set_ptr {
                    return std::make_shared<ItemSet>(*item, grammar);
                });
                result.merge(new_set, [&](const item_set_ptr left, const item_set_ptr right) -> item_set_ptr {
                    return left;
                });
            }
            return result;
        }

        TransitionMap<ItemSet> ItemSet::sym_transitions(const Grammar &grammar) const {
            auto result = TransitionMap<ItemSet>();
            for (auto item : *this) {
                auto new_set = item.transitions()
                    .where([&](const rules::rule_ptr &on_rule) -> bool {
                        return typeid(*on_rule) == typeid(rules::Symbol);
                    })
                    .map<ItemSet>([&](const item_ptr &item) -> item_set_ptr {
                        return std::make_shared<ItemSet>(*item, grammar);
                    });
                result.merge(new_set, [&](const item_set_ptr left, const item_set_ptr right) -> item_set_ptr {
                    return left;
                });
            }
            return result;
        }

        bool ItemSet::operator==(const tree_sitter::lr::ItemSet &other) const {
            return contents == other.contents;
        }
        
#pragma mark - container
        ItemSet::const_iterator ItemSet::begin() const {
            return contents.begin();
        }

        ItemSet::const_iterator ItemSet::end() const {
            return contents.end();
        }

        size_t ItemSet::size() const {
            return contents.size();
        }
        
#pragma mark - printing
        ostream& operator<<(ostream &stream, const ItemSet &item_set) {
            stream << string("(item_set ");
            for (Item item : item_set) {
                stream << item;
                stream << string(" ");
            }
            stream << string(")");
            return stream;
        }
    }
}