Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Hands-On Design Patterns and Best Practices with Julia

You're reading from   Hands-On Design Patterns and Best Practices with Julia Proven solutions to common problems in software design for Julia 1.x

Arrow left icon
Product type Paperback
Published in Jan 2020
Publisher Packt
ISBN-13 9781838648817
Length 532 pages
Edition 1st Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
Tom Kwong Tom Kwong
Author Profile Icon Tom Kwong
Tom Kwong
Arrow right icon
View More author details
Toc

Table of Contents (19) Chapters Close

Preface 1. Section 1: Getting Started with Design Patterns
2. Design Patterns and Related Principles FREE CHAPTER 3. Section 2: Julia Fundamentals
4. Modules, Packages, and Data Type Concepts 5. Designing Functions and Interfaces 6. Macros and Metaprogramming Techniques 7. Section 3: Implementing Design Patterns
8. Reusability Patterns 9. Performance Patterns 10. Maintainability Patterns 11. Robustness Patterns 12. Miscellaneous Patterns 13. Anti-Patterns 14. Traditional Object-Oriented Patterns 15. Section 4: Advanced Topics
16. Inheritance and Variance 17. Assessments 18. Other Books You May Enjoy

Working with expressions

Julia represents the source code of any runnable program as a tree structure. This is called an abstract syntax tree (AST). It is referred to as abstract as the tree only captures the structure of the code rather than the real syntax. 

For example, the expression x + y can be represented with a tree where the parent node identifies itself as a function call and the child nodes include the operator function + and the x and y arguments. The following is an implementation of this:

The slightly more complex expression x + 2y + 1 would look like the following diagram. While it was written with two addition operators, the expression is parsed into a single function call to the + function, for which it takes three arguments—x, 2y, and 1. Because 2y is itself an expression, it can be seen as a subtree...

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
Banner background image