 |
|
|
|
|
 |
 |
|
A General Pattern Matcher
|
|
|
|
|
|
| Organization: | Universidad Autonoma de Querétaro |
| Department: | Facultad de Informatica |
|
|
|
|
|
|
2010-07-22
|
|
|
|
|
|
In this work we deal with pattern matching on expressions consisting of finite words from the set of non-capital English characters. Patterns will be described by words built from arbitrary English characters with the proviso that capital letters will stand for sub-blocks appearing in a structured context in the expression to be matched. We would like to know why pattern matching is so in the affirmative case, confirming the word as matching the given pattern by offering an explicit instantiation of the names forming its description. This mechanism is referred to as unification and its computation as parsing the given word. We implement the unification and parsing in our main recursive function. Finally, we present the Mathematica pattern mechanism similar to Prolog's backtracking; contrasting thus the two approaches.
|
|
|
|
|
|
|
|
|
|
|
|
pattern, matching
|
|
|
|
|
|
| AGeneralPatternMatcher.rar (21.7 KB) - Unknown MIME type |
|
|
For the newest resources, visit Wolfram Repositories and Archives »
