From aa8abf47f01801566a43d62f1283dfa8191fed99 Mon Sep 17 00:00:00 2001 From: tocariimaa Date: Thu, 13 Mar 2025 22:37:06 -0300 Subject: [PATCH] articles/abstract_syntax_tree.md: update --- articles/abstract_syntax_tree.md | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/articles/abstract_syntax_tree.md b/articles/abstract_syntax_tree.md index 74bbfe3..4cf96f8 100644 --- a/articles/abstract_syntax_tree.md +++ b/articles/abstract_syntax_tree.md @@ -6,9 +6,10 @@ concrete syntax tree. An AST is the first [intermediate representation](intermediate_representation.md) used by a programming language, being created by a [parser](parser.md). Usually this tree is -later decorated with additional information by the compiler, such as typing information. +later decorated with additional information by the compiler, such as typing information in latter compilation +phases, in this case the semantic analysis phase. -[Lisp](lisp.md) famously uses a very simple syntax for its source code, (S-Expressions)(sexpression.md), which makes +[Lisp](lisp.md) famously uses a very simple syntax for its source code, [S-Expressions](sexpression.md), which makes the AST evident and makes Lisp [homoiconic](homoiconic.md). For this C function that calculates the factorial of *n*: