Skip to content

Update docs for egraph semantic analysis. #268

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
0x0f0f0f merged 2 commits into from
Feb 24, 2025
Merged

Update docs for egraph semantic analysis. #268

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
d1b050e
Update docs for semantic analysis (for #267).
gkronber Feb 20, 2025
e9e8244
Remove @show statement.
gkronber Feb 20, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 4 additions & 4 deletions docs/src/egraphs.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -325,14 +325,14 @@ From the definition of an e-node, we know that children of e-nodes are always ID
to e-classes in the `EGraph`.

```@example custom_analysis
function EGraphs.make(g::EGraph{ExpressionType,OddEvenAnalysis}, op, n::VecExpr) where {ExpressionType}
function EGraphs.make(g::EGraph{ExpressionType,OddEvenAnalysis}, n::VecExpr) where {ExpressionType}
op = get_constant(g, v_head(n))
v_isexpr(n) || return odd_even_base_case(op)
# The e-node is not a literal value,
# Let's consider only binary function call terms.
if v_iscall(n) && arity(n) == 2
op = operation(n)
child_eclasses = v_children(n)
if v_iscall(n) && length(child_eclasses) == 2
# Get the left and right child eclasses
child_eclasses = arguments(n)
l,r = g[child_eclasses[1]], g[child_eclasses[2]]

if !isnothing(l.data) && !isnothing(r.data)
Expand Down
Loading