Search icon CANCEL
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Supercharge Your Applications with GraalVM

You're reading from   Supercharge Your Applications with GraalVM Hands-on examples to optimize and extend your code using GraalVM's high performance and polyglot capabilities

Arrow left icon
Product type Paperback
Published in Aug 2021
Publisher Packt
ISBN-13 9781800564909
Length 360 pages
Edition 1st Edition
Languages
Tools
Arrow right icon
Author (1):
Arrow left icon
A B Vijay Kumar A B Vijay Kumar
Author Profile Icon A B Vijay Kumar
A B Vijay Kumar
Arrow right icon
View More author details
Toc

Table of Contents (17) Chapters Close

Preface 1. Section 1: The Evolution of JVM
2. Chapter 1: Evolution of Java Virtual Machine FREE CHAPTER 3. Chapter 2: JIT, HotSpot, and GraalJIT 4. Section 2: Getting Up and Running with GraalVM – Architecture and Implementation
5. Chapter 3: GraalVM Architecture 6. Chapter 4: Graal Just-In-Time Compiler 7. Chapter 5: Graal Ahead-of-Time Compiler and Native Image 8. Section 3: Polyglot with Graal
9. Chapter 6: Truffle for Multi-language (Polyglot) support 10. Chapter 7: GraalVM Polyglot – JavaScript and Node.js 11. Chapter 8: GraalVM Polyglot – Java on Truffle, Python, and R 12. Chapter 9: GraalVM Polyglot – LLVM, Ruby, and WASM 13. Section 4: Microservices with Graal
14. Chapter 10: Microservices Architecture with GraalVM 15. Assessments 16. Other Books You May Enjoy

Learning Truffle DSL

Truffle defines a Domain-Specific Language (DSL) based on the Java annotation processor. The language developer has to write a lot of boilerplate code to manage the states of the specializations. To appreciate how Truffle DSL makes a programmer's life easy, let's take a quick example:

c = a + b

As we discussed earlier in this chapter, in AST, every operation and operand is represented as a node. In Truffle, it is a Java class derived from com.oracle.truffle.api.nodes.Node. To understand the need for a DSL, let's oversimplify the implementation of AST for the preceding expression.

Since we are looking at dynamically typed languages, a and b can be any type. We need an expression node that should implement an execute method, which checks for all the possible types for a and b. We will have to write logic something like this:

Figure 6.5 – Guard checks for implementing specialization – flow chart

In the...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime