This repository was archived by the owner on Sep 10, 2025. It is now read-only.
Conversation
This lexer will parse programs, skipping unknown characters, and collapsing repeated occurrences of identical tokens. The result will be a stream of values which can be compiled.
I've updated the lexer to skip newlines/unknown characters, and avoid handling repeated loop open/closes - since we need to count those separately. We're now using the lexer in our generation and that is good.
Oftentimes brainfuck programs are formatted in a "readable" fashion
with newlines, and spaces. If we have an input-program that
looks like this:
> ---------------------------------
> ---------------------------------
> +++----
We'd parse that naively as:
> {Type: "-", Repeat: X}
> {Type: "-", Repeat: X}
> {Type: "+", Repeat: X}
> {Type: "-", Repeat: X}
i.e. The first two lines would count as two tokens. If we remove
the newlines before we process the input we instead get:
> {Type: "-", Repeat: X}
> {Type: "+", Repeat: X}
> {Type: "-", Repeat: X}
This file contains hidden or 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
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
1 participant
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.
This pull-request, once complete, will replace our inline parsing with a standalone brainfuck lexer.
The lexer will produce a stream of tokens, along with a count of how many times those tokens were seen repeated.
So given an input string of "
<<<<<>>>>>" we'll expect to see:{Type: "<", Repeat: 5}{Type: ">", Repeat: 5}{Type: EOF, Repeat: 1}Trivial cases added too, but not exhaustively. This will close #3.