Beefy Boxes and Bandwidth Generously Provided by pair Networks RobOMonk
Think about Loose Coupling
 
PerlMonks  

Re^4: Comparative satisfiability of regexps.

by qq (Hermit)
on Jan 21, 2005 at 17:34 UTC ( #424074=note: print w/ replies, xml ) Need Help??


in reply to Re^3: Comparative satisfiability of regexps.
in thread Comparative satisfiability of regexps.

Update: I'm also having trouble seeing the utility of this proposed checker. Suppose I have two arbitrary web applications A and B, and both were kind enough to supply xsd schemas. Can I determine if they can interact meaniningfully? Not really. It's a matter of semantics, not just matching schemas.

I hope the OP answers this, because its been interesting so far. But for the calendaring application mentioned, why not create a simple schema and require conformance? It would need to be done per client with xslt (the glue language of xml!) or whatever. But without explicit agreement you are just guessing that elements from different schemas with similar names describe the same real-world objects. Sounds dangerous.


Comment on Re^4: Comparative satisfiability of regexps.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://424074]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (6)
As of 2014-04-19 06:11 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    April first is:







    Results (478 votes), past polls