StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
2878071
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2010-05-20T21:40:45.017
FavoriteCount
0
LastActivityDate
2010-05-20T21:40:45.017
LastEditDate
2017-05-23T11:54:47.530
LastEditorUserId
-1
OwnerUserId
163832
ParentId
929819
PostTypeId
2
Score
2
ViewCount
0
LastEditorDisplayName
text
Body
The Wikipedia article on recursive ascent parsing references what appears to be the original paper on the topic ("Very Fast LR Parsing"). Skimming that paper cleared a few things up for me. Things I noticed: <ol> <li>The paper talks about generating assembly code. I wonder if you can do the same things they do if you're generating C or Java code instead; see sections 4 and 5, "Error recovery" and "Stack overflow checking". (I'm not trying to FUD their technique -- it might work out fine -- just saying that it's something you might want to look into before committing.)</li> <li>They compare their recursive ascent tool to their own table-driven parser. From the description in their results section, it looks like their table-driven parser is "fully interpreted"; it doesn't require any custom generated code. I wonder if there's a middle ground where the overall structure is still table-driven but you generate custom code for certain actions to speed things up.</li> </ol> The paper referenced by the Wikipedia page: <ul> <li>"Very fast LR parsing" (1986)</li> <li><a href="http://portal.acm.org/citation.cfm?id=13310.13326" rel="nofollow noreferrer">http://portal.acm.org/citation.cfm?id=13310.13326</a></li> </ul> Another paper about using code-generation instead of table-interpretation: <ul> <li>"Very fast YACC-compatible parsers (for very little effort)" (1999)</li> <li><a href="http://www3.interscience.wiley.com/journal/1773/abstract" rel="nofollow noreferrer">http://www3.interscience.wiley.com/journal/1773/abstract</a></li> </ul> Also, note that recursive-descent parsing is not the fastest way to parse LL-grammar-based languages: <ul> <li><a href="https://stackoverflow.com/questions/1044600/difference-between-an-ll-and-recursive-descent-parser">Difference between an LL and Recursive Descent parser?</a></li> </ul>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POHow do recursive ascent parsers work?
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USCommunity
UserOwnerUserId
1. USKannan Goundan
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. 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.