3 ms·
IMHO you're often best off with writing a simple recursive descent parser by hand. For lexing you can often get away with splitting the input string at word bou
by adrianN 8y ago
IMHO you're often best off with writing a simple recursive descent parser by hand. For lexing you can often get away with splitting the input string at word boundaries.
For slightly more advanced needs, parser combinator libraries make parsing and lexing quite straightforward. I honestly wouldn't use a parser generator.
- angara 8y agoRegular expressions are also useful for lexing. I like to work from this example code from the Python standard library docs: https://docs.python.org/3.6/library/re.html#writing-a-tokenizer https://docs.python.org/3.6/library/re.html#writing-a-tokeni...
- fanf2 8y agoRemember, `lex` is just a pile of regular expressions, so it is great for simple parsing in C. There are good reasons it was known as the Swiss Army knife of Unix before scripting took over :-)
- swiley 8y agoIMHO recursive ascent is both easier to write and faster.