Admin message

Attention: i10git will shutdown soon!

This i10git GitLab server was migrated to gitos.rrze.fau.de due to hardware issues with the current host. This affects all production repositories, including waLBerla, lbmpy, pystencils and HyTeG.

Login: Gitos supports DFN-AAI and eduGAIN. If your institution does not support either, please use our GitHub mirrors.

Onboarding: All repositories belonging to groups were migrated. To regain access, first log in to gitos.rrze.fau.de once to activate your account. Then email cs10-admin@fau.de with your old i10git and your new gitos.rrze username (the @) as shown on your respective user profiles. We will reassign your accordingly. Note: Repositories from former courses (e.g. advpt) were not migrated.

Personal repositories in individual user namespaces were not migrated. Please export these yourself before the old server is shut down.

Expected shutdown by the end of 2026. Until then, the old i10git server will still be reachable with all repositories archived (read only). However, due to the ongoing hardware issues, it may remain unreliable and will receive no further maintenance.

The parent group is archived. This project and its data are read-only.
Abstract Syntax Tree
The abstract syntax tree is the core data structure of the backend. It represents the generated C code on a level of abstraction fit for pystencils. The range of syntax and structure represented by the AST is from the kernel function (upper limit) to just above the arithmetic-logical expressions (lower limit). Above that, code generation is the business of whatever framework pystencils is embedded in. Below, we use `pymbolic`. ## Class Hierarchy and Syntax Modelling The base class of the AST nodes shall be `PsAstNode`. Its primary tasks are: - Manage the branching structure - Manage custom metadata There shall be a dedicated class for each required syntactic structure, including: - *Loops:* We model increment-type loops by `PsLoop` - *Expressions:* Expressions are modelled using pymbolic. Each pymbolic expression in the AST is wrapped in the `PsExpression` leaf node or its subclasses. ## Typing in Expressions In a well-formed AST, all pymbolic expressions must be fully typed; they may contain no bare `Variable`s and no bare constants, but only their typed variants `PsTypedVariable` and `PsTypedConstants` (see pycodegen/pystencils#77). ## Correspondence to frontend data structures and metadata The AST is made up of a fixed set of backend data structures, and shall contain no frontend (e.g. SymPy-related) data structures in its primary structure. However, mappings to front-end structures might be managed within the AST metadata. A metadata dict shall exist on each AST node for any frontend to store arbitrary data in. The backend shall not access that metadata. ## Visitors As most algorithms on the AST will follow the visitor pattern, a type-based visitor dispatcher is provided to simplify the implementation of recursive visitor-type algorithms.
task