Outer Web | Explore

/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.

You are here		ahmedhosssam.github.io Ahmed Hossam
\|	\|	swtch.com Implementing Regular Expressions	4.3 parsecs away Travel
\|	\|	[AI summary] This article compiles resources and implementations for creating efficient regular expression search algorithms using finite automata and DFA/NFA methods.	4.3 parsecs away Travel
\|	\|	nnethercote.github.io Quirks of Rust's token representation \| Nicholas Nethercote	4.1 parsecs away Travel
\|	\|	Like most compilers, rustc (the Rust compiler) has a lexer that breaks source code into tokens, which are small units such as identifiers, literals, operators, and punctuation. The parser then checks that these tokens are present in an order that satisfies Rust's grammar.	4.1 parsecs away Travel
\|	\|	zserge.com cucu: a compiler you can understand (1/3)	3.8 parsecs away Travel
\|	\|	Compilers is fun. Want to write your own one? Part 1 - lexer.	3.8 parsecs away Travel
\|	\|	usethe.computer Irregular Expressions: You Need a Parser	24.4 parsecs away Travel
\|		Some people, when confronted with a problem, think "I know, I'll use regular expressions." Now they have two problems. -Jamie Zawinski	24.4 parsecs away Travel