实践编程语言设计：《Language Implementation Patterns》深度解析

语言实现模式

需积分: 31 132 浏览量更新于2024-07-17 收藏 5.97MB PDF 举报

身份认证购VIP最低享 7 折!

领优惠券(最高得80元）

资源详情

资源推荐

HOW TO READ THIS BOOK 16

To get the most out of this book, you should be fairly comfortable with

recursion. Many algorithms and processes are inherently recursive.

We’ll use recursion to do everything from recognizing input, walking

trees, and building interpreters to generatin g output.

How to Read This Book

If you’re new to language implementation, start with Chapter 1, Lan-

guage Applications Cracked Open, on page

20 because it provides an

architectural overview of how we build languages. You can then move

on to Chapter 2, Basic Parsing Patterns, on page 37 and Chapter 3,

Enhanced Parsing Patterns, on page

65 to get some background on

grammars (formal lan guage descriptions) and language recognition.

If you’ve taken a fair number of computer science courses , you can

skip ahead to either Chapter

4, Building Intermediate Form Trees, on

page

88 or Chapter 5, Walking and Rewriting Trees, on page 116. Even

if you’ve built a lot of trees and tree walkers in your career, it’s still

worth looking at Pattern 14, Tree Grammar, on page 134 and Patt ern

15, Tree Pattern Matcher, on page 138.

If you’ve done some basic language application work before, you alr eady

know how to read input into a handy tree data structure and walk it.

You can skip ahead to Chapter

6, Tracking and Identifying Program

Symbols, on page

146 and Chapter 7, Managing Symbol Tables for Data

Aggregates, on page

170, which describe how to build symbol tables.

Symbol tables answer the question “What is x?” for some input symbol

x. They are necessary data structures for the patterns in Chapter 8,

Enforcing Static Typing Rules, on page

196, for example.

More advanced readers might want to jump directly to Chapter

9, Build-

ing High-Level Interpreters, on page

232 and Chapter 12, Generating

DSLs with Templates, on page

323. If you really know what you’re doing,

you can skip around the book looking for patterns of interest. The truly

impatient can grab a sample implementation from a pattern and use it

as a kernel for a n ew language (relying on the book for explanations).

If you bought the e-book version of this book, you can click the gray

boxes above the code samples to download code snippets directly. If

you’d like to participate in conversations with me and other readers,

you can do so at the web page for this book

or on the ANTLR user’s

1. http://www.pragprog.com/titles/tpdsl

Report erratum

this copy is (P1.0 printing, December 2009)

Prepared exclusively for Ron Brown

LANGUAGES AND TOOLS USED IN THIS BOOK 17

list.

You can also post book errata and download all the source code

on the book’s web page.

Languages and Tools Used in This Book

The code snippets and implementations in this book are written inJava,

but their substance applies equally well to any other general program-

ming language. I had to pick a single programming language for con-

sistency. Java is a good choice because it’s widely used in industry.

3,4

Remember, this book is about design patterns, not “language recipes.”

You can’t just download a pattern’s sample implementation and apply

it to your problem without modiﬁcation.

We’ll use state-of-the-art language tools wherever possible in this book.

For example, to recognize (parse) input phrases, we’ll use aparser gen-

erator (well, that is, after we learn how to build parsers manu ally in

Chapter

2, Basic Parsing Patterns, on page 37). It’s no fair using a

parser generator until you know how parsers work. That’d be like using

a calculator before learning to do arithmetic. Similarly, once we know

how to build tree walkers by hand, we can let a tool build them for us.

In this book, we’ll us e ANTLR extensively. ANTLR is a parser generator

and tree walker generator that I’ve honed over the past two decades

while building language applications. I could have used any similar

language tool, but I might as well use my own. My point is that this

book is not about ANTLR itself—it’s about the design patterns common

to most language applications. The code samples merely help you to

understand the patterns.

We’ll also use a template engine called StringTemplate a lot in Chap-

ter

12, Generating DSLs with Templates, on page 323 to generate out-

put. StringTemplate is like an “unparser generator,” and templates are

like output g rammar rules. The alternative to a template engine would

be to use an unstructured blob of generation logic interspersed with

print statements.

You’ll be able to follow the patterns in this book even if you’re not famil-

iar with ANTLR and StringTemplate. Only the sample implementations

use them. To get the most out of the patterns, though, you should walk

2. http://www.antlr.org/support.html

3. http://langpop.com

4. http://www.tiobe.com/index.php/content/paperinfo/tpci/index.html

Report erratum

this copy is (P1.0 printing, December 2009)

Prepared exclusively for Ron Brown

剩余388页未读，继续阅读

heaven_h_c

粉丝: 1
资源: 3

实践编程语言设计：《Language Implementation Patterns》深度解析

Antlr4指南

Language Implementation Patterns

Addison Wesley - Implementation Patterns.pdf

那Patterns.psp 又是什么用呢

mlir中patterns.add<>()的作用是神那么

*** multiple target patterns. Stop.

patterns.add("/user/user/login");

大模型 英文怎么翻译

scintilla设置LUA语法

*** multiple target patterns.

*** multiple target patterns.怎么解决

qt出现报错信息multiple target patterns. stop

请给出一个grep -f命令的示例

Could not auto-determine entry point from rollupOptions or html files and there are no explicit optimizeDeps.include patterns. Skipping dependency pre-bundling.

head first design patterns-深入浅出设计模式.pdf

android 如何校验邮箱的格式是否正确

collected, slice_weights = 0, [] for __, s in SLICES_INFO.items(): collected += s['client_weight'] slice_weights.append(collected) collected, mb_weights = 0, [] for __, mb in MOBILITY_PATTERNS.items(): collected += mb['client_weight'] mb_weights.append(collected)

最新资源

大模型英文怎么翻译