Miss Dada  🏳️‍⚧️

The lexer is dependent on the parser state james

nno

if I was the ruby parser I would simply make it possible to parse as ast = parser(lexer(input)) where parser and lexer are pure functions. But I am not the ruby parser and it is not simple

I didn’t even know you *could* have something other than parser(lexer(input))

You can't parse C with parser(lexer(input))

this isn't *strictly* true (I mean you can parse any language with a composition of those functions, even if they're pure, for given definitions of those functions). Like we *could* build a ruby parser where the lexer was a pure scanner, but it would be very hard.

where does the lexer use state from the parser?

Symbol table to disambiguate typedefs in expressions like (A) * B.