Modern perfect hashing for strings
Strategies for very fast Lexers
Making compilation pipelines fast, starting with the tokenizer
@foone
Bison is like weird flex but okay.
#parsing #LexicalAnalysis
incremental parsing in go | dev-nonsense
This post is an attempt to explain the incremental parsing algorithm aretext uses for syntax highlighting.
Like the rest of aretext, parsers are implemented in Go for portability and performance. Most people do not consider Go a functional programming language; nonetheless, aretext’s parsers rely on functional programming patterns. In this post, we’ll see how to implement these patterns in pure Go to build parsers that are fast and expressive.
Problem Syntax highlighting is a special case of parsing.

Building Your Own Programming Language From Scratch: Part VI - Loops | HackerNoon
In this part of creating your programming language, we'll implement For, While and For-each loops. We'll implement and test the bubble sort algorithm