StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
11358002
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
2
CommunityOwnedDate
CreationDate
2012-07-06T07:48:14.470
FavoriteCount
0
LastActivityDate
2012-07-06T10:17:21.827
LastEditDate
2017-05-23T12:32:32.410
LastEditorUserId
-1
OwnerUserId
1495442
ParentId
11306641
PostTypeId
2
Score
2
ViewCount
0
LastEditorDisplayName
text
Body
You can read about regexes in <a href="http://books.google.com/books?id=dlzthEZGkmsC&pg=PA477#v=onepage&q&f=false" rel="nofollow noreferrer">An Introduction to Language And Linguistics By Ralph W. Fasold, Jeff Connor-Linton P.477</a> Chomsky Hierarchy: Type0 >= Type1 >= Type2 >= Type3 Computational Linguistics mainly features Type 2 & 3 Grammars • Type 3 grammars: –Include regular expressions and finite state automata (aka, finite state machines) –The focal point of the rest of this talk • Type 2 grammars: –Commonly used for natural language parsers –Used to model syntactic structure in many linguistic theories (often supplemented by other mechanisms) –We will play a key roll in the next talk on parsing. <hr> most XMLs like <a href="http://en.wikipedia.org/wiki/DGML" rel="nofollow noreferrer">Microsoft DGML</a> (Directed Graph Markup Language) that has inter-relational links are samples that Regex are useless. <hr> and this three answers may be useful: 1 - <a href="https://stackoverflow.com/questions/2974210/does-lookaround-affect-which-languages-can-be-matched-by-regular-expressions/2991587#2991587">does-lookaround-affect-which-languages-can-be-matched-by-regular-expressions</a> 2 - <a href="https://cstheory.stackexchange.com/questions/448/regular-expressions-arent">regular-expressions-arent</a> 3 - <a href="https://cstheory.stackexchange.com/questions/1047/where-do-most-regex-implementations-fall-on-the-complexity-scale">where-do-most-regex-implementations-fall-on-the-complexity-scale</a>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POWhat kind of formal languages can modern regex engines parse?
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USCommunity
UserOwnerUserId
1. USRia
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. COThanks for the links, very helpful.
 singulars
 PostPostId
 PO
 UserUserId
 USgeorg
2. COXML or [Microsoft DGML](http://en.wikipedia.org/wiki/DGML) (Directed Graph Markup Language) are samples that Regex are useless.
 singulars
 PostPostId
 PO
 UserUserId
 USRia

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.