Struct ExpressionAst

pub struct ExpressionAst {
    pub original_source: String,
    pub kind: ExpressionKind,
}

Parsed expression abstract syntax tree

This represents common expression patterns found in OpenMP directives. It’s not a complete C/C++/Fortran parser, just enough to handle typical OpenMP expressions.

Learning: Recursive Data Structures

Notice that ExpressionKind contains Box<ExpressionAst> in several variants. This allows representing nested expressions like:

• (a + b) * c - BinaryOp containing another BinaryOp
• arr[i][j] - ArrayAccess containing another ArrayAccess

Example

use roup::ir::{Expression, ParserConfig};

let config = ParserConfig::default();
let expr = Expression::new("42", &config);

if let Some(ast) = expr.as_ast() {
    // Can inspect the AST structure
    println!("Original: {}", ast.original_source);
}

Fields

original_source: String

Original source text (always preserved)

kind: ExpressionKind

Parsed structure (best-effort)

Trait Implementations

impl Clone for ExpressionAst

fn clone(&self) -> ExpressionAst

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for ExpressionAst

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for ExpressionAst

fn eq(&self, other: &ExpressionAst) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for ExpressionAst