Skip to content

Look into the least common ancestor algorithm when merging subparsers #157

Description

@paulgazz

There may be a bug in an optimization that attempts to avoid inserting static conditional nodes around shared semantic values by computing the least common ancestor of mergeable subparsers. This wouldn't affect correctness, but could cause additional static conditional nodes to be inserted when not needed.

Should be fixable in the subparser merge function by moving the StackFrame s = ... into the for loop below it.

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions