After building our skills parsing linearly/recursively nested lists, it was time to parse a JSON string. The goal of the project was as follows: When given a JSON string, our lexical analyzer will parse the string and create a Token whenever it runs into one - allowing the user of ‘Lex’ to get tokens for each part of the JSON string. The solution required an understanding of how Lex was doing it’s job (parsing the string). All Lex does is parse the string, and create tokens, so it needs to be told where to start and when to stop when creating these tokens. Each time it stops, it will have a token ready for the user. After completing this assignment recursion began to come naturally, and we were ready to put the tokens we generated to good use.
Check it out here.
Next up: Recursive List Nodes