Build your own programming language : a programmer's guide to designing compilers, interpreters, and DSLs for solving modern computing problems / Clinton L. Jeffery
Material type:
- 9781800204805
- QA 76.7 .J44 2021

Item type | Current library | Home library | Collection | Call number | Copy number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|---|
![]() |
National University - Manila | LRC - Main General Circulation | Digital Forensic | GC QA 76.7 .J44 2021 (Browse shelf(Opens below)) | c.1 | Available | NULIB000019532 |
Browsing LRC - Main shelves, Shelving location: General Circulation, Collection: Digital Forensic Close shelf browser (Hides shelf browser)
No cover image available |
![]() |
![]() |
![]() |
![]() |
![]() |
No cover image available | ||
GC QA 76.5 .D35 2008 Computers are your future : complete / | GC QA 76.5 .M67 2009 Understanding computers : today and tomorrow / | GC QA 76.6 .T46 2020 The Pragmatic programmer : your journey to mastery / | GC QA 76.7 .J44 2021 Build your own programming language : a programmer's guide to designing compilers, interpreters, and DSLs for solving modern computing problems / | GC QA 76.7 .N97 2021 Crafting interpreters / | GC QA 76.7 .S43 2020 Concepts of programming languages / | GC QA 76.9 .C66 [?] c.3 CS 212 : computer architecture, study guide. |
Includes index.
Why Build Another Programming Language -- Programming Language Design -- Scanning Source Code -- Parsing -- Syntax Trees -- Symbol Tables -- Checking Base Types -- Checking Types on Arrays, Method Calls, and Structure Accesses -- Intermediate Code Generation -- Syntax Cloning in an IDE -- Bytecode Interpreters -- Generating Bytecode -- Native Code Generation -- Implementing Operators and Built-In Functions -- Domain Control Structures -- Garbage Collection -- Final Thoughts -- Appendix A - Unicon Essentials.
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.
There are no comments on this title.