StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
19735110
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2013-11-01T20:44:21.330
FavoriteCount
0
LastActivityDate
2013-11-04T09:57:28.763
LastEditDate
2013-11-04T09:57:28.763
LastEditorUserId
901780
OwnerUserId
901780
ParentId
19734655
PostTypeId
2
Score
1
ViewCount
0
LastEditorDisplayName
text
Body
Firstly take care of data structures - it's a good practice. As you see, there are may be these structures: <pre class="lang-cpp prettyprint-override"><code>map<string, int> answers; struct question { int id; string text; int answer; } list<question> questions; </code></pre> As you see it's better to place answers in file before questions. Why? Because you can write a program by this way: <ol> <li>Parse answers and fill <code>answers</code> map.</li> <li>Parse question and fill <code>questions</code>. Just put an answer's number in <code>answers[answer_string]</code> to get a corresponding answer's number.</li> </ol> Now you have everything to create an algorithm. Lets see how does generally work a simple parser for this case: <ol> <li>Skip all spaces.</li> <li>Read a symbol <code>s</code>. If <code>s == 'W'</code> then read an answer's number. Else if <code>s == 'Q'</code> read a question's number.</li> <li>If <code>s == '"'</code> read a question's string until next '"'.</li> <li>If <code>s == '['</code> read a question's answer string until ']'.</li> <li>If <code>s == '<'</code> read an answer's string until '>'.</li> </ol> Just use these rules and you will get a recursive parsing algorithm. Also it would be good to read about <a href="http://en.wikipedia.org/wiki/Recursive_descent_parser" rel="nofollow">recursive descent parsers</a> for details. That's all! You have data structures and an algorithm. Now you can write some code. And why not to use a number for question's answer instead of string to reduce duplications? :-) 
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POComplex C++ Text File IO
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USYuriy
UserOwnerUserId
1. USYuriy
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
CommentsPostId
1. This table or related slice is empty.

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.