Context-Free Closure and Single-Stack Matching

A language is context-free if its only stack obligation is one matching, plus regular filters that closure preserves.