| Validation with Xtext [message #651408] |
Sun, 30 January 2011 16:00  |
 Patrick Arnold
Messages: 1
Registered: January 2011 |
Junior Member |
|
|
Hey,
we consider to read up in Xtext for realizing a grammar, yet before we want to do this, we'd like to know whether our problem can be realized in Xtext and whether Xtext is the appropriate tool respectively.
We have a program which runs several algorithms A, B, C, ... which can be run consecutively and/or in parallel. Also, each algorithm can be run or not run. However, only a few combinations ("workflow") are defined as valid (feasible), so some algorithms cannot be run if not another algorithm has been run before (or vice versa), some algorithms can only be run in parallel (or not be run in parallel) etc.
For instance, we define algorithm B can only be run after A has been run, C and D can be run both in parallel or consecutively, E can only be run if A has not be run before etc. Do you think that developing such a grammar is possible in Xtext? It is also very important for us to verify such a workflow, e.g. to verify the workflow A, B, (E, G), C whether it matches the grammar (valid) or not (not valid) and if not, what the reason for this was (e.g. "The workflow is not valid, because C must not be run after E has been run"). Has Xtext such opportunities for validation/verification? This would be important for us to know before we try to create a grammar in Xtext.
Thank you in advance.
Best regards
Patrick
|
|
|
|
Powered by
FUDForum. Page generated in 0.03149 seconds
] 
Search
Help
Register
Login
Home
