Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Assert that input chracters are in the alphabet when reading in a TCM file #155

Open
recursion-ninja opened this issue Oct 25, 2019 · 0 comments
Assignees
Labels
defect minor Likely to take less than 10 hours of work.

Comments

@recursion-ninja
Copy link
Collaborator

When we read in data files and associate them with a TCM, they inherit the alphabet defined in the TCM file.

We need to assert that every symbol found in the input files are symbols defined in the alphabet of the TCM file.

If we don't do this at "unification time," we can get very, very cryptic errors with empty dynamic character elements when decorating the tree.

@recursion-ninja recursion-ninja changed the title Assert that input chracters are in the alphabet when read in in a TCM file Assert that input chracters are in the alphabet when reading in a TCM file Nov 17, 2020
@recursion-ninja recursion-ninja added the minor Likely to take less than 10 hours of work. label Mar 18, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
defect minor Likely to take less than 10 hours of work.
Projects
None yet
Development

No branches or pull requests

2 participants