Operator Precedence Languages (OPL) are deterministic context-free and have desirable properties. OPL are parallely parsable, and, when structurally compatible, are closed under Boolean operations, concatenation and star; they include the Input Driven languages. OPL use three relations between two terminal symbols, to assign syntax structure to words. We extend such relations to k-tuples of consecutive symbols, in agreement with strictly locally testable regular languages. For each k, the new corresponding class of Higher-order Operator Precedence languages properly includes the OPL and enjoy many of their properties. OPL are a strict hierarchy based on k, which contains maximal languages.

运算符优先级语言（OPL）是确定性的上下文无关的，并且具有所需的属性。OPL是可并行解析的，并且在结构上兼容时，会在布尔运算，串联和星号下关闭；它们包括输入驱动语言。OPL使用两个终端符号之间的三个关系，将语法结构分配给单词。与严格本地可测试的常规语言一致，我们将这种关系扩展到连续符号的k个元组。对于每个k，新的对应类的高阶运算符优先级语言正确包含OPL并享有其许多属性。OPL是基于k的严格层次结构，其中包含最大语言。