Book Image

Build Your Own Programming Language

By : Clinton L. Jeffery
Book Image

Build Your Own Programming Language

By: Clinton L. Jeffery

Overview of this book

The need for different types of computer languages is growing rapidly and developers prefer creating domain-specific languages for solving specific application domain problems. Building your own programming language has its advantages. It can be your antidote to the ever-increasing size and complexity of software. In this book, you’ll start with implementing the frontend of a compiler for your language, including a lexical analyzer and parser. The book covers a series of traversals of syntax trees, culminating with code generation for a bytecode virtual machine. Moving ahead, you’ll learn how domain-specific language features are often best represented by operators and functions that are built into the language, rather than library functions. We’ll conclude with how to implement garbage collection, including reference counting and mark-and-sweep garbage collection. Throughout the book, Dr. Jeffery weaves in his experience of building the Unicon programming language to give better context to the concepts where relevant examples are provided in both Unicon and Java so that you can follow the code of your choice of either a very high-level language with advanced features, or a mainstream language. By the end of this book, you’ll be able to build and deploy your own domain-specific languages, capable of compiling and running programs.
Table of Contents (25 chapters)
1
Section 1: Programming Language Frontends
7
Section 2: Syntax Tree Traversals
13
Section 3: Code Generation and Runtime Systems
21
Section 4: Appendix

Questions

  1. Describe how intermediate code instructions with up to three addresses are converted into a sequence of stack machine instructions that contain at most one address.
  2. If a particular instruction (say it is instruction 15, at byte offset 120) is targeted by five different labels (for example, L2, L3, L5, L8, and L13), how are the labels processed when generating binary bytecode?
  3. In intermediate code, a method call consists of a sequence of PARM instructions followed by a CALL instruction. Does the described bytecode for doing a method call in bytecode match up well with the intermediate code? What is similar and what is different?
  4. CALL instructions in object-oriented (OO) languages such as Jzero are always preceded by a reference to the object (self, or this) on which the methods are being invoked… or are they? Explain a situation in which the CALL method instruction may have no object reference, and how the code generator described in this chapter should...