Learning by doing Parsing Theory?

I want to learn how to create parsers.

Being able to parse some nontrivial data on input and produce meaningful representation of this data on the outside. General goal is to be able to create parsers.

Can you suggest a roadmap how to do that?

regex ;D .... and take a look at the regex to NFA transformations as well as the NFA to DFA transformations.

or you wanna stay superficial :) learn regex.

could you suggest a good book which describe theory behind it ?

and one more question. what this translation NFA to DFA important in a first place? what the point of doing that ?

Nick Luparev

it's one of the basic transformations of the graph to switch "memory" vs "time" so a DFA takes more memory but it has less options to move between states.

In some cases it's better to have NFA but usually in compiler design you move towards the optimized DFA instead of the NFA.

I like basics of compiler design from Torben Æ Mogensen. But there are lot of others :) they don't specialize into parser specifically but the first chapters till the AST and the optimizations might help to get a better grip.

Thread

Learning by doing Parsing Theory?

Responses(1)

Recent in Forum

Search Hashnode

Learning by doing Parsing Theory?

Responses(1)

Recent in Forum