QuickBasic Object Modeling
In the previous chapter, you saw how the lexical analyzer, or scanner, transforms the raw characters of source code into a stream of token objects, where each token object has a start index and a length. In the next chapter, you’ll see how this stream of token objects is converted to a nested structure of BNF grammar categories, as described in Chapter 4, while also emitting output code for a “machine,” which exists purely as a software simulation of the Nutty Professor machine.
KeywordsVariable Type Business Rule Unknown Type Token Object Null String
Unable to display preview. Download preview PDF.