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. Write a regular expression to match dates in dd/mm/yyyy format. Is it possible to write this regular expression so that it only allows legal dates?
  2. Explain the difference between the return value that yylex() returns to the caller, the lexeme that yylex() leaves in yytext, and the token value that yylex() leaves in yylval.
  3. Not all the yylex() regular expressions return an integer category after they match. When a regular expression does not return a value, what happens?
  4. Lexical analysis has to deal with ambiguity and it is entirely possible to write several regular expressions that all can match at a given point in the input. Describe Flex's tie-breaking rules for when more than one regular expression can match at the same place.