{"action":"opened","issue":{"url":"https://api.github.com/repos/dimitri/cl-abnf/issues/3","labels_url":"https://api.github.com/repos/dimitri/cl-abnf/issues/3/labels{/name}","comments_url":"https://api.github.com/repos/dimitri/cl-abnf/issues/3/comments","events_url":"https://api.github.com/repos/dimitri/cl-abnf/issues/3/events","html_url":"https://github.com/dimitri/cl-abnf/issues/3","id":123117834,"number":3,"title":"Phooey on no recursive grammar rules.","user":{"login":"heegaiximephoomeeghahyaiseekh","id":12368105,"avatar_url":"https://avatars.githubusercontent.com/u/12368105?v=3","gravatar_id":"","url":"https://api.github.com/users/heegaiximephoomeeghahyaiseekh","html_url":"https://github.com/heegaiximephoomeeghahyaiseekh","followers_url":"https://api.github.com/users/heegaiximephoomeeghahyaiseekh/followers","following_url":"https://api.github.com/users/heegaiximephoomeeghahyaiseekh/following{/other_user}","gists_url":"https://api.github.com/users/heegaiximephoomeeghahyaiseekh/gists{/gist_id}","starred_url":"https://api.github.com/users/heegaiximephoomeeghahyaiseekh/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/heegaiximephoomeeghahyaiseekh/subscriptions","organizations_url":"https://api.github.com/users/heegaiximephoomeeghahyaiseekh/orgs","repos_url":"https://api.github.com/users/heegaiximephoomeeghahyaiseekh/repos","events_url":"https://api.github.com/users/heegaiximephoomeeghahyaiseekh/events{/privacy}","received_events_url":"https://api.github.com/users/heegaiximephoomeeghahyaiseekh/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":0,"created_at":"2015-12-20T00:11:06Z","updated_at":"2015-12-20T00:11:06Z","closed_at":null,"body":"I tried to create a grammar for a programming language, only to get the error\r\n\"Can not expand recursive rule: ABNF-EXPRESSION.\"\r\n\r\nIn any programming language, expressions necessarily have a recursive grammar,  because\r\nexpressions can contain subexpressions which have the same grammar as the original expression. Without the ability to handle recursive grammars, ABNF cannot be used to parse the source code of any programming language.\r\n\r\n"}}