Lexical Scanning in Go - Rob Pike

I would like to mention that most, if not all, of the Go compiler and related utilities is written in Go itself, with high quality, open source code that can be found in the "go" package of the standard library: [link] I would recommend using that as a template for one's own compiler, because it's written in idiomatic Go (originally by the language creators) and is cleanly split across abstraction boundaries (packages "scanner", "parser", "ast", and so on.) There's also a smaller, simpler parser in the "text/template/parse" package, that is used to parse the templating languages in "text/template" and "html/template". As an introduction to it, I recommend the talk "Lexical Scanning in Go" by Rob Pike: ▶ this video

in “Writing a Compiler in Go” · View on HN

Wow, perfect timing! I'm currently writing my first lexer/parser in D as well ( [link] ) for a Scheme-like language used in Halo 3. I found Rob Pike's talk on lexical scanning to be pretty useful ( ▶ this video ) and I've modeled mine pretty heavily after the text/template lexer: [link] .

in “Implementing a programming language in D: Lexical Analysis” · View on HN

For those who don't know who Rob Pike is, he's pretty awesome, helped create UTF-8 among other things, and now works on Go. [link] He has given some really great Go talks which are available on youtube, about an hour each: Origins of Go Concurrency Style - [link] Lexical Scanning in Go - ▶ this video Go Concurrency Patterns (One of my favorites) - [link]

in “Less is exponentially more (2012)” · View on HN

I'm not sure I like the idea of parsing templates with regular expressions. There is a better way, as demonstrated in Robe Pike's video[1] detailing how the Go template language is implemented. Edit: which isn't meant to detract from the fact that this is a great article. [1] ▶ this video

in “Building a toy template engine in Python” · View on HN

> Building a lexer out of a recursive function type actually sounds like a really cool thing to try Rob Pike did just that for Go's text/template package ( [link] ). See the source lexer source code at [link] and note that stateFn is defined recursively. There's a video by Pike describing how he built the parser at ▶ this video .

in “Function types in Go” · View on HN

> What most people don't realize is that for concurrency to be useful, there must be parallelism. No, as far as I understand from this and other talks, Rob Pike argues that concurrency is useful even without parallelism: it's a better way to structure software. A nice example for this is shown in his talk about lexical scanning in Go: ▶ this video

in “Concurrency is not Parallelism. Rob Pike at Waza 2012 [video]” · View on HN

As an aside: watching Pike's talk on lexing and parsing in Go really hits this point home. It shows how language support for cheap threads (goroutines) and channels really change the way you come up with an algorithm. ▶ this video

in “Go is amazing, period.” · View on HN

There are many explanations. The most famous one Rob Pike in his lexer talk 2011 ▶ this video at 10.48 Or [link] Or several articles why you should not parse with regex, like [link]

in “From string to AST: parsing (2019)” · View on HN

Here's a video of Rob Pike, developer of Go, talking about a lexer he built for the Go text/template package: ▶ this video It supports unicode.

in “On the Complexity and Performance of Parsing with Derivatives” · View on HN

I thought this would be a good opportunity to use 'state functions' to implement a shell for Bytengine. Rob Pike mentions the use of state functions in his talk "Lexical Scanning in Go" ▶ this video

in “Implementing a shell for Bytengine using 'state functions'” · View on HN

type state struct { // add any fields you need to persist here } type transition func(*state) transition same as in Lexical Scanning in Go ( ▶ this video )

in “State Machines in Go” · View on HN

Check out the std lib: [link] -- that's canonical Go code. It's my language of choice for personal projects. A neat and compact language that is very trivial to pick up, feels light, and yet sufficiently subtle to intellectually engage your mind. Very productive, good performance, and very portable. ▶ this video caveat: /imho/ the runtime is not yet fully cooked. ETA is Go1.1 (end of year I believe) for beefed up internals.

in “Carbon: high level programming language that compiles to plain C” · View on HN

> I think Go spent a lot of time implying that goroutines were some sort of special language magic, but I think everybody knows now that they are basically a really good implementation of green threads that can take advantage of some internal knowledge to do optimal scheduling to avoid context switches. It took me a while to work this out, and I got a lot of pushback from the go team when I pointed this out internally. This comment deeply fascinates me, because I get the same feeling every time I go back and read/watch early Go resources from Rob Pike and others, but I've never actually heard it articulated before. I've always thought that surely they weren't that ignorant about PL theory and history? Or maybe Rob Pike himself was, but surely his team knew better? It really feels like they thought they were making some special hybrid between threads and coroutines, combining the advantages of both. Like this 2011 talk[1] which demonstrated a classic coroutine code pattern implemented with goroutines and channels. But as time went on, goroutines became fully pre-emptive, and their programming model is now identical to threads. Using them as coroutines only leads to misery (read: data races) in my experience. They're faster than OS threads, sure, but that's an implementation detail at this point. When do you think they eventually realized they were re-inventing the same green threads Java had created and scrapped 10 years earlier? [1] ▶ this video

in “Go: What we got right, what we got wrong” · View on HN

I have to admit that when I first heard the Jackson reference in ▶ this video I thought it was about the other Jackson.

in “Jackson structured programming” · View on HN