AnyOrder

AnyOrder[p1,p2,…]

is a grammar rules pattern object that represents a sequence of elements matching p1, p2, … in any order.

Details

Examples

open allclose all

Basic Examples  (2)

Extract elements of a string, which may appear in any order:

Deploy a grammar that allows phrases to appear in any order:

Apply the grammar:

Applications  (1)

Deploy a simple calculator that supports infix, Polish, and reverse Polish notation:

This calculator is not programmed to apply precedence to different operators:

Properties & Relations  (1)

In a grammar, FixedOrder requires a specific order and AnyOrder supports arbitrary order:

Here the input matches the order in the FixedOrder:

The input does not match the order in the FixedOrder:

Wolfram Research (2015), AnyOrder, Wolfram Language function, https://reference.wolfram.com/language/ref/AnyOrder.html.

Text

Wolfram Research (2015), AnyOrder, Wolfram Language function, https://reference.wolfram.com/language/ref/AnyOrder.html.

CMS

Wolfram Language. 2015. "AnyOrder." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/AnyOrder.html.

APA

Wolfram Language. (2015). AnyOrder. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/AnyOrder.html

BibTeX

@misc{reference.wolfram_2024_anyorder, author="Wolfram Research", title="{AnyOrder}", year="2015", howpublished="\url{https://reference.wolfram.com/language/ref/AnyOrder.html}", note=[Accessed: 22-December-2024 ]}

BibLaTeX

@online{reference.wolfram_2024_anyorder, organization={Wolfram Research}, title={AnyOrder}, year={2015}, url={https://reference.wolfram.com/language/ref/AnyOrder.html}, note=[Accessed: 22-December-2024 ]}