38c144b4a3
* While generating the lex table, note which tokens can match the same string. A token needs to be relexed when it has possible homonyms in the current state. * Also note which tokens can match substrings of each other tokens. A token needs to be relexed when there are viable tokens that could match longer strings in the current state and the next token has been edited. * Remove the logic for marking tokens as fragile on creation. * Store the reusability/non-reusability of symbols off of individual actions and onto the entire entry for the state & symbol.
87 lines
3.5 KiB
C++
87 lines
3.5 KiB
C++
#include "spec_helper.h"
|
|
#include "helpers/rule_helpers.h"
|
|
#include "compiler/rules/built_in_symbols.h"
|
|
#include "compiler/parse_table.h"
|
|
#include "compiler/build_tables/lex_conflict_manager.h"
|
|
#include "compiler/build_tables/lex_item.h"
|
|
|
|
using namespace rules;
|
|
using namespace build_tables;
|
|
|
|
START_TEST
|
|
|
|
describe("LexConflictManager::resolve(new_action, old_action)", []() {
|
|
LexConflictManager conflict_manager;
|
|
bool update;
|
|
Symbol sym1(0, true);
|
|
Symbol sym2(1, true);
|
|
Symbol sym3(2, true);
|
|
Symbol sym4(3, true);
|
|
LexItemSet item_set({ LexItem(sym4, blank() )});
|
|
|
|
it("favors advance actions over empty accept token actions", [&]() {
|
|
update = conflict_manager.resolve(item_set, AdvanceAction(2, {0, 0}, true), AcceptTokenAction());
|
|
AssertThat(update, IsTrue());
|
|
});
|
|
|
|
describe("accept-token/accept-token conflicts", [&]() {
|
|
describe("when the tokens' precedence values differ", [&]() {
|
|
it("favors the token with higher precedence", [&]() {
|
|
update = conflict_manager.resolve(AcceptTokenAction(sym2, 1, false), AcceptTokenAction(sym1, 2, false));
|
|
AssertThat(update, IsFalse());
|
|
|
|
update = conflict_manager.resolve(AcceptTokenAction(sym1, 2, false), AcceptTokenAction(sym2, 1, false));
|
|
AssertThat(update, IsTrue());
|
|
});
|
|
|
|
it("adds the preferred token as a possible homonym for the discarded one", [&]() {
|
|
conflict_manager.resolve(AcceptTokenAction(sym2, 1, false), AcceptTokenAction(sym1, 2, false));
|
|
AssertThat(conflict_manager.possible_homonyms[sym2], Contains(sym1));
|
|
});
|
|
});
|
|
|
|
describe("when one token is string-based and the other is regexp-based", [&]() {
|
|
it("favors the string-based token", [&]() {
|
|
update = conflict_manager.resolve(AcceptTokenAction(sym1, 0, false), AcceptTokenAction(sym2, 0, true));
|
|
AssertThat(update, IsFalse());
|
|
|
|
update = conflict_manager.resolve(AcceptTokenAction(sym2, 0, true), AcceptTokenAction(sym1, 0, false));
|
|
AssertThat(update, IsTrue());
|
|
});
|
|
});
|
|
|
|
describe("when the tokens have equal precedence", [&]() {
|
|
it("favors the token listed earlier in the grammar", [&]() {
|
|
update = conflict_manager.resolve(AcceptTokenAction(sym2, 0, false), AcceptTokenAction(sym1, 0, false));
|
|
AssertThat(update, IsFalse());
|
|
|
|
update = conflict_manager.resolve(AcceptTokenAction(sym1, 0, false), AcceptTokenAction(sym2, 0, false));
|
|
AssertThat(update, IsTrue());
|
|
});
|
|
});
|
|
});
|
|
|
|
describe("advance/accept-token conflicts", [&]() {
|
|
describe("when the token to accept has higher precedence", [&]() {
|
|
it("prefers the accept-token action", [&]() {
|
|
update = conflict_manager.resolve(item_set, AdvanceAction(1, { 1, 2 }, true), AcceptTokenAction(sym3, 3, true));
|
|
AssertThat(update, IsFalse());
|
|
AssertThat(conflict_manager.possible_extensions, IsEmpty());
|
|
});
|
|
});
|
|
|
|
describe("when the token to accept does not have a higher precedence", [&]() {
|
|
it("favors the advance action", [&]() {
|
|
update = conflict_manager.resolve(item_set, AdvanceAction(1, { 1, 2 }, true), AcceptTokenAction(sym3, 2, true));
|
|
AssertThat(update, IsTrue());
|
|
});
|
|
|
|
it("adds the in-progress tokens as possible extensions of the discarded token", [&]() {
|
|
conflict_manager.resolve(item_set, AdvanceAction(1, { 1, 2 }, true), AcceptTokenAction(sym3, 3, true));
|
|
AssertThat(conflict_manager.possible_extensions[sym3], Contains(sym4));
|
|
});
|
|
});
|
|
});
|
|
});
|
|
|
|
END_TEST
|