Contents

F R A Hopgood

April 1974

• Contents
• PREFACE
• 1 INTRODUCTION
  • 1.1 TREE-META, a Translator Writing System
  • 1.2 TREE-META Translator
  • 1.3 Notation
  • 1.4 TREE-META Program
  • 1.5 PLASYD Reserved Words
• 2 SYNTAX RULES
  • 2.1 Syntax
  • 2.2 The Method of Syntax Analysis
  • 2.3 Diagnostics
  • 2.4 Syntax Tests
  • 2,5 Recursion
  • 2.6 Factoring of Alternatives
  • 2.7 Repetition
  • 2.8 An Example
• 3 TREE BUILDING
  • 3.1 Syntax
  • 3.2 Trees
  • 3.3 The TREE-META Stack
  • 3.4 Adding Specific Strings to the Stack
  • 3.5 Tree-building Commands
  • 3.6 Specifying Name and Branches of a Node Separately
  • 3.7 Backtracking
  • 3.8 Complete Trees
• 4 CODE RULES
  • 4.1 Syntax
  • 4.2 Code Generation
  • 4.3 Node Names
  • 4.4 Node Tests
  • 4.5 Output Expressions
  • 4.6 Output Text
  • 4.7 Decoding Nodes
  • 4.8 Null Item
  • 4.9 Calling Code Rules Directly
  • 4.10 Subexpressions
  • 4.11 Simple Code Rules
• 5 LABELS
  • 5.1 Introduction
  • 5.2 Labels in Output Expressions
  • 5.3 Labels as Arguments
• 6 ARITHMETIC STATEMENTS
  • 6.1 Syntax
  • 6.2 Arithmetic List
  • 6.3 Assignment Statements
  • 6.4 Arithmetic Functions
  • 6.5 Subroutine Calls
  • 6.6 Relations
  • 6.7 Counting
• 7 SYMBOL TABLES
  • 7.1 Syntax
  • 7.2 Symbol Table Entry
  • 7.3 Symbol Table Routines
  • 7.4 Scanning the Symbol Table
• 8 USING TREE-META ON THE 1906A
  • 8.1 Introduction
  • 8.2 Generating a Translator using TREE-META
  • 8.3 Using the Translator
  • 8.4 A Simple Example
  • 8.5 Diagnostics
• 9 THE TREE-META SYSTEM
  • 9.1 Introduction
  • 9.2 Augmenting TREE-META
  • 9.3 Modifying the Input Routine
  • 9.4 TREE-META Data Structures
  • 9.5 TREE-META Library
  • 9.6 Inserting Code in the Translator
• APPENDICES
  • Appendix 1. 1900 INTERNAL CHRACTER SET
  • Appendix 2 SYNTAX DEFINITIONS OF TREE-META
  • Appendix 3. TREE-META DEFINITION
  • Appendix 4. TREE-META LIBRARY ROUTINES
  • Appendix 5, TREE-META DIAGNOSTICS
  • Appendix 6. A COMPLETE EXAMPLE