Thus, the code in the example would pass the Lexical Analysis, but then would be rejected by the Parser. We could possibly modify the Tokenizer and make it much more complex, so that it would also be able to spot errors…
Thus, the code in the example would pass the Lexical Analysis, but then would be rejected by the Parser. We could possibly modify the Tokenizer and make it much more complex, so that it would also be able to spot errors…