User loginNavigation |
Ï€: a pattern languageπ - not to be confused with the π-calculus - is a pattern-based language being developed by the Software Technology group at Technische UniversitÃ¤t Darmstadt. Quoting from the project website:
The basic idea here seems similar to the OMeta language, previously mentioned on LtU here, but based on EBNF instead of Parsing Expression Grammars (PEGs). Pattern definitions in π have the form declare_pattern name â‰” syntax â‡’ type âžž meaning; Here's a trivial example of defining a pattern: declare_pattern integer_potentiation â‰” integer:i %W- "^" %W- integer:j â‡’ integer âžž { int result = i; for (int k = 1; k <= j-1; k++) result *= i; return result; }; The resulting pattern can then be used directly in expressions, such as More information about the language, as well as the implementation, can be found at http://www.pi-programming.org. There's an OOPSLA09 paper on π as well, but I haven't been able to find an open access version of it yet. [Update: the π team has made their OOPSLA article available here] |
Browse archivesActive forum topics |
Recent comments
1 hour 14 min ago
10 hours 46 min ago
13 hours 26 min ago
14 hours 54 min ago
16 hours 37 min ago
17 hours 55 min ago
18 hours 2 min ago
18 hours 5 min ago
18 hours 7 min ago
1 day 18 hours ago