PatternForth: A Pattern-Matching Language for Real-Time Control

Full text of dissertation.

• A. Introduction (7K)
1. The Problem(s)
2. Perceived Requirements
3. Previous Languages
• B. Project Scope (8K)
1. Essential Features
2. Optional Features
• C. Dynamic Memory Management (19K, 15K linked images)
1. Design
2. The Boundary Tag Representation
3. Allocating Memory
4. Memory Release
5. Future work
• D. Associative String Access (39K, 26K linked images)
1. Design
2. The hash table
3. Multiple hash tables
4. Creating strings
5. Destroying strings
6. The associated data field
7. Garbage collection
8. Future work
• E. Pattern Matching (44K, 64K linked images)
1. Traditional
2. Executable patterns
3. Element representation
4. Concatenation of successors
5. Alternation
6. Grouping: Mixing concatenation and alternation
7. Backtracking
8. The History context
9. Subpatterns
10. Deferred evaluation
11. Recursion in patterns
12. The Top Level pattern
13. Implications for Coroutines
14. Future work
• F. Pattern and String Operations (14K)
1. Basic string operators
2. Derived string operators
3. String variables
4. Basic pattern operators
5. Derived pattern operators
6. Capturing match results
7. String replacement
8. Pattern variables
9. Run-time compilation
10. Future work
• G. Conclusions (1K)
• H. References (6K)
• I. Figures (2K, 105K linked images)
• Appendix A. PatternForth Glossary (21K)
• Appendix B. The Program Listing (61K)