[
Skip Navigation]
≡
β©οΈ
π£οΈ
-
π
Search
:
Wiki
:
abstract syntax tree
≡
Welcome
Signin
Create Account
abstract syntax tree@Search
View
Source
History
Discussion
Search Group
Create/Find Pages
Group Feed
My Groups
π
Locale: en-US
Page: abstract syntax tree
β
ποΈ
Page Type:
Standard
Page and Feedback
Page Alias
Media List
Presentation
Url Shortener
Share Wall
Alias Page To:
Page Border:
Solid
Dashed
None
Table of Contents:
Title:
Author:
Meta Robots:
Meta Description:
Meta Properties (such as Open Graph)
One line per property in format: name|content
Header Page Name:
Footer Page Name:
== Abstract syntax tree ==
:
while b β 0: if a > b: a := a - b else: b := b - a return a
]] In computer science, an abstract syntax tree (AST), or just syntax tree, is a tree representation of the abstract syntactic structure of text (often source code) written in a formal language. Each node of the tree denotes a construct occurring in the text.
[[https://en.wikipedia.org/wiki/Abstract_syntax_tree|More at Wikipedia...]]
X
(c) 2024 Yioop -
PHP Search Engine
We use cookies to implement this site's user functionality, social media features, and traffic analytics.
Privacy Policy Details
.
Allow Cookies