Book Image

Build Your Own Programming Language - Second Edition

By : Clinton L. Jeffery
Book Image

Build Your Own Programming Language - Second Edition

By: Clinton L. Jeffery

Overview of this book

There are many reasons to build a programming language: out of necessity, as a learning exercise, or just for fun. Whatever your reasons, this book gives you the tools to succeed. You’ll build the frontend of a compiler for your language and generate a lexical analyzer and parser using Lex and YACC tools. Then you’ll explore a series of syntax tree traversals before looking at code generation for a bytecode virtual machine or native code. In this edition, a new chapter has been added to assist you in comprehending the nuances and distinctions between preprocessors and transpilers. Code examples have been modernized, expanded, and rigorously tested, and all content has undergone thorough refreshing. You’ll learn to implement code generation techniques using practical examples, including the Unicon Preprocessor and transpiling Jzero code to Unicon. You'll move to domain-specific language features and learn to create them as built-in operators and functions. You’ll also cover garbage collection. Dr. Jeffery’s experiences building the Unicon language are used to add context to the concepts, and relevant examples are provided in both Unicon and Java so that you can follow along in your language of choice. By the end of this book, you'll be able to build and deploy your own domain-specific language.
Table of Contents (27 chapters)
1
Section I: Programming Language Frontends
7
Section II: Syntax Tree Traversals
13
Section III: Code Generation and Runtime Systems
22
Section IV: Appendix
23
Answers
24
Other Books You May Enjoy
25
Index

Scanning strings in Icon and Unicon

Unicon inherits this domain control structure from its immediate predecessor, Icon. In Icon and Unicon, a control structure called string scanning is invoked by the s ? expr syntax. Within expr, the string s is the scanning subject and it is referenced by a global keyword called &subject. Within the subject string, a current analysis position, which is stored in the &pos keyword, denotes the index location in the subject string where that string is being scanned. The position starts at the beginning of the string and can be moved back and forth, typically working its way toward the end of the string. For example, in the following program, s contains "For example, suppose string s contains":

procedure main()
   s := "For example, suppose string s contains"
   s ? {
      tab(find("suppose"))
      write("after tab()")
   }
end

Now, let’s say we were adding the above-mentioned scanning...