web.stanford.edu/class/cs143/lectures/lecture04.pdf
web.stanford.edu · 2,907 words · saved by 1 readers
N/A
Implementation of Lexical Analysis CS143 Lecture 4 Instructor: Fredrik Kjolstad Slide design by Prof. Alex Aiken, with modifications 1 Written Assignments • WA1 assigned today • Due in one week – 11:59pm – Electronic hand-in on Gradescope 2 Tips on Building Large Systems • KISS (Keep It Simple, Stupid!) • Don’t optimize prematurely • Design systems that can be tested • It is easier to modify a working system than to get a system working…
related reading
- Thompson's construction - Wikipediaen.wikipedia.org
- Implementing Regular Expressionsswtch.com
- Yudhister Kumaryudhister.me
- Lexical analysis - Wikipediaen.wikipedia.org
- Regular expression - Wikipediaen.wikipedia.org
- Beating the fastest lexer generator in Rustalic.dev
- Reading 12: Regular Expressions & Grammarsweb.mit.edu
- Index 1,600,000,000 Keys with Automata and Rust - Andrew Gallant's Blogburntsushi.net
- Context-free grammar - Wikipediaen.wikipedia.org
- GitHub - kyx0r/pikevm: Russ Cox/Rob Pike pikevm regex implementationgithub.com
- PA1.pdfweb.stanford.edu
- Chomsky hierarchy - Wikipediaen.wikipedia.org