Jump to content

Recommended Posts

Posted

I was wondering, - is it possible to mechanically, partially reverse engineer a grammar for a language That is not to say I expect it to be perfect in any way (depending on the language complexity and the input set). But it would be very interesting with some level of grammar inference to boost prototyping parser generation. It's an interesting problem in many ways: recognizing patterns, weighing them, isolating them in definitions. At a lower level, some sort of state machine that captures possible combinations based on some input set (assuming what is not said, is not sayable - to some extent).

 

More...

 

View All Our Microsoft Related Feeds

  • Replies 0
  • Created
  • Last Reply

Top Posters In This Topic

Popular Days

Top Posters In This Topic

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Reply to this topic...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.


×
×
  • Create New...