StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POFormal languages generator?
primarykey
Id
17425187
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
2013-07-02T15:47:12.363
CommentCount
9
CommunityOwnedDate
CreationDate
2013-07-02T12:05:55.973
FavoriteCount
0
LastActivityDate
2013-07-02T15:15:50.950
LastEditDate
2013-07-02T15:15:50.950
LastEditorUserId
331021
OwnerUserId
331021
ParentId
0
PostTypeId
1
Score
3
ViewCount
757
LastEditorDisplayName
text
Body
I'm wondering if there exists a library (preferably in .NET) for generating outputs based on formal grammars. I'm talking about this: <a href="https://en.wikipedia.org/wiki/Chomsky_hierarchy#Formal_grammars" rel="nofollow">https://en.wikipedia.org/wiki/Chomsky_hierarchy#Formal_grammars</a> So you give it the grammar as in: (Non-terminal symbols, Terminal symbols, Production rules, Start symbol) so: <pre><code>Grammar = ({E,A,B}, {(,),a,+,*}, P, E); Where P = { E -> A, E -> E + A, A -> B, A -> A * B, B -> a, B -> (E) }; </code></pre> And then the library would produce example random outputs of that grammar like: <pre><code>a * a + a a + (a + a) a * a * a </code></pre> What I'm going to do after either creating or finding a library like this is to then change the way it produces the output to make it more biased to produce certain examples more than others, so in the previous example I can make it more biased to produce more expressions with addition in them rather than multiplication. So basically assign weights to production rules to make some of them more likely to get applied when there is more than one valid. So my main question is, is there a library out there that can do the first step which is producing random outputs based on a formal grammar like my example? Update Thinking about this problem again, I have a few more notes: <ul> <li>One of the problems here is to know when to stop applying production rules. Either make sure that the grammar does stop at some point or devise a way in the algorithm/code that makes it less likely to keep expanding the expression further on.</li> <li>I realise now that this might be too theoretical and there is probably a more practical way. I mean, there have to be some tools out there that essentially do this same thing but maybe just use a different syntax or approach that is more specific to certain problems or maybe something more flexible.</li> </ul>
Tags
<c#><.net><grammar><formal-languages>
Title
Formal languages generator?
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. USSpace monkey
UserOwnerUserId
1. USSpace monkey
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
 POFormal languages generator?
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
2. VO
 singulars
 PostPostId
 POFormal languages generator?
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
3. VO
 singulars
 PostPostId
 POFormal languages generator?
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
CommentsPostId

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.