Revision as of 03:20, 16 February 2022 edit Citation bot (talk \| contribs) Bots 5,868,529 edits Alter: title. \| Use this bot. Report bugs. \| Suggested by EthanGaming7640 \| Category:Pattern matching \| #UCB_Category 3/33 ← Previous edit		Revision as of 16:04, 3 April 2022 edit undo Jarble (talk \| contribs) Autopatrolled, Extended confirmed users 150,084 edits I added this text here by mistake: this article is not about string matching. Next edit →
Line 10: Often it is possible to give alternative patterns that are tried one by one, which yields a powerful [[Conditional (programming)\|conditional programming construct]]. Pattern matching sometimes includes support for [[guard (computing)\|guards]].{{citation needed\|date=January 2019}} [[Parsing]] algorithms often rely on pattern matching to transform strings into [[Abstract syntax tree\|syntax tree]]s.<ref>Warth, Alessandro, and Ian Piumarta. "[http://tinlizzie.org/~awarth/papers/dls07.pdf OMeta: an object-oriented language for pattern matching]." Proceedings of the 2007 symposium on Dynamic languages. ACM, 2007.</ref><ref>Knuth, Donald E., James H. Morris, Jr, and Vaughan R. Pratt. "Fast pattern matching in strings." SIAM journal on computing 6.2 (1977): 323-350.</ref> ==History==

Pattern matching: Difference between revisions