Table of Contents

Readme file (first release) (7th November 1988)

Part I: INTRODUCTION (24th July 1988)

• INTRODUCTION
• THE CRADLE

Part II: EXPRESSION PARSING (24th July 1988)

• GETTING STARTED
• SINGLE DIGITS
• BINARY EXPRESSIONS
• GENERAL EXPRESSIONS
• USING THE STACK
• MULTIPLICATION AND DIVISION
• PARENTHESES
• UNARY MINUS
• A WORD ABOUT OPTIMIZATION

Part III: MORE EXPRESSIONS (4th Aug 1988)

• INTRODUCTION
• VARIABLES
• FUNCTIONS
• MORE ON ERROR HANDLING
• ASSIGNMENT STATEMENTS
• MULTI-CHARACTER TOKENS
• WHITE SPACE

Part IV: INTERPRETERS (24th July 1988)

• INTRODUCTION
• THE INTERPRETER
• A LITTLE PHILOSOPHY

Part V: CONTROL CONSTRUCTS (19th Aug 1988)

• INTRODUCTION
• THE PLAN
• SOME GROUNDWORK
• THE IF STATEMENT
• THE WHILE STATEMENT
• THE LOOP STATEMENT
• REPEAT-UNTIL
• THE FOR LOOP
• THE DO STATEMENT
• THE BREAK STATEMENT
• CONCLUSION

Part VI: BOOLEAN EXPRESSIONS (31st Aug 1988)

• INTRODUCTION
• THE PLAN
• THE GRAMMAR
• RELOPS
• FIXING THE GRAMMAR
• THE PARSER
• MERGING WITH CONTROL CONSTRUCTS
• ADDING ASSIGNMENTS

Part VII: LEXICAL SCANNING (7th Nov 1988)

• INTRODUCTION
• LEXICAL SCANNING
• STATE MACHINES AND ALTERNATIVES
• SOME EXPERIMENTS IN SCANNING
• WHITE SPACE
• STATE MACHINES
• NEWLINES
• OPERATORS
• LISTS, COMMAS AND COMMAND LINES
• GETTING FANCY
• RETURNING A CHARACTER
• DISTRIBUTED vs. CENTRALIZED SCANNERS
• MERGING SCANNER AND PARSER
• CONCLUSION

Part VIII: A LITTLE PHILOSOPHY (2nd Apr 1989)

• INTRODUCTION
• THE ROAD HOME
• WHY IS IT SO SIMPLE?
• CONCLUSION

Part IX: A TOP VIEW (16th Apr 1989)

• INTRODUCTION
• THE TOP LEVEL
• THE STRUCTURE OF PASCAL
• FLESHING IT OUT
• DECLARATIONS
• THE STRUCTURE OF C

Part X: INTRODUCING "TINY" (21st May 1989)

• INTRODUCTION
• GETTING STARTED
• DECLARATIONS
• DECLARATIONS AND SYMBOLS
• INITIALIZERS
• THE SYMBOL TABLE
• EXECUTABLE STATEMENTS
• BOOLEANS
• CONTROL STRUCTURES
• LEXICAL SCANNING
• MULTI-CHARACTER VARIABLE NAMES
• MORE RELOPS
• INPUT/OUTPUT
• CONCLUSION

Part XI: LEXICAL SCAN REVISITED (3rd Jun 1989)

• INTRODUCTION
• BACKGROUND
• THE PROBLEM
• THE SOLUTION
• FIXING UP THE COMPILER
• CONCLUSION
• TINY VERSION 1.1

Part XII: MISCELLANY (5th Jun 1989)

• INTRODUCTION
• SEMICOLONS
• SYNTACTIC SUGAR
• DEALING WITH SEMICOLONS
• A COMPROMISE
• COMMENTS
• SINGLE-CHARACTER DELIMITERS
• MULTI-CHARACTER DELIMITERS
• ONE-SIDED COMMENTS
• CONCLUSION

Part XIII: PROCEDURES (27th Aug 1989)

• INTRODUCTION
• ONE LAST DIGRESSION
• THE BASICS
• A BASIS FOR EXPERIMENTS
• DECLARING A PROCEDURE
• CALLING THE PROCEDURE
• PASSING PARAMETERS
• THE SEMANTICS OF PARAMETERS
• PASS-BY-VALUE
• WHAT'S WRONG?
• CALL-BY-REFERENCE
• LOCAL VARIABLES
• CONCLUSION

Part XIV: TYPES (26th May 1990)

• INTRODUCTION
• WHAT'S COMING NEXT?
• THE SYMBOL TABLE
• ADDING ENTRIES
• ALLOCATING STORAGE
• DECLARING TYPES
• ASSIGNMENTS
• THE COWARD'S WAY OUT
• A MORE REASONABLE SOLUTION
• LITERAL ARGUMENTS
• ADDITIVE EXPRESSIONS
• WHY SO MANY PROCEDURES?
• MULTIPLICATIVE EXPRESSIONS
• MULTIPLICATION
• DIVISION
• BEGINNING TO WIND DOWN
• TO COERCE OR NOT TO COERCE
• CONCLUSION

Part 15: BACK TO THE FUTURE (5th Mar 1994)

• INTRODUCTION
• NEW STARTS, OLD DIRECTIONS
• STARTING OVER?
• THE INPUT UNIT
• THE OUTPUT UNIT
• THE ERROR UNIT
• SCANNING AND PARSING
• THE SCANNER UNIT
• DECISIONS, DECISIONS
• PARSING
• REFERENCES

Part 16: UNIT CONSTRUCTION (29th May 1995)

• INTRODUCTION
• JUST LIKE CLASSICAL?
• FLESHING OUT THE PARSER
• TERMS AND EXPRESSIONS
• ASSIGNMENTS
• BOOLEANS
• BOOLEAN "AND"