StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
6083976
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
1
CommunityOwnedDate
CreationDate
2011-05-21T19:30:34.070
FavoriteCount
0
LastActivityDate
2011-05-21T19:30:34.070
LastEditDate
LastEditorUserId
0
OwnerUserId
678735
ParentId
4208733
PostTypeId
2
Score
2
ViewCount
0
LastEditorDisplayName
text
Body
Microsoft has a SMT-based gratis (MSRL-licensed) "Rex" tool for this: <a href="http://research.microsoft.com/en-us/downloads/7f1d87be-f6d9-495d-a699-f12599cea030/" rel="nofollow">http://research.microsoft.com/en-us/downloads/7f1d87be-f6d9-495d-a699-f12599cea030/</a> From the Introduction section of the "Rex: Symbolic Regular Expression Explorer" paper: <blockquote> We translate (extended) regular expressions or regexes [5] into a symbolic representation of finite automata called SFAs. In an SFA, moves are labeled by formulas representing sets of characters rather than individual characters. An SFA A is translated into a set of (recursive) axioms that describe the acceptance condition for the strings accepted by A and build on the representation of strings as lists. </blockquote> As the SMT solver can output all possible solutions within some size bound, this may be close to what you're looking for. On a more statistical and less formal front, the Regexp::Genex module from CPAN can work as well: <a href="http://search.cpan.org/dist/Regexp-Genex/" rel="nofollow">http://search.cpan.org/dist/Regexp-Genex/</a> You can use it with something like this: <pre><code>#!/usr/bin/env perl use Regexp::Genex ':all'; my $hits = 100; my $re = qr/[a-z](123|456)/; local $Regexp::Genex::DEFAULT_LEN = length $re; my %seen; while ((time - $^T) < 2) { @seen{strings($re)} = (); $Regexp::Genex::DEFAULT_LEN++; } print "$_\n" for (sort %seen)[0..$hits-1]; </code></pre> Adjust the time and sample size as needed. Hope this helps!
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POGenerative regular expressions
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USaudreyt
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
2. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
CommentsPostId
1. COI've just implemented another "output all possible solutions" tool at https://github.com/audreyt/regex-genex with the yices2 SMT solver. Might be useful as well. :-)
 singulars
 PostPostId
 PO
 UserUserId
 USaudreyt

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.