reduce repetitions #4
Open
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
Working zero case truth machine example (the un-reduced example code on master) : |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Crochet patterns use a form of run length encoding to reduce pattern instruction length.
CCT will be a RLE version of CT -- will need to add this to the converter. Or create an optimiser stage/tool.
Though non RLE instructions should always be valid too.
This branch experiments with the syntax using
[rep .... ] n timesnotation.TODO: implement proper parsing and interpretation of
repTesting
regex to highlight the start / stop bit encoded text in the example:
Bytes are read from the right edge leftwards. The first byte (rightmost) is
\x02(STX). Reading from right-to-left, it has aŦ(1) start bit, then the byte\x02(MSB first), followed by a+(0) stop bit, then the first character of the string with its start and stop bits, and so on, ending with a start / stop bit bounded\03(ETX):+ ŦŦ++++++ Ŧ.