QuickBasic Object Modeling

  • Edward G. Nilges


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.


Variable Type Business Rule Unknown Type Token Object Null String 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Edward G. Nilges 2004

Authors and Affiliations

  • Edward G. Nilges
    • 1
    • 2
    • 3
  1. 1.Roosevelt University in ChicagoUSA
  2. 2.DeVry UniversityUSA
  3. 3.Princeton UniversityUSA

Personalised recommendations