|
Is there a place I can find Backus–Naur Form or BNF grammars for popular languages? Whenever I do a search I don't turn up much, but I figure they must be published somewhere. I'm most interested in seeing one for Objective-C and maybe MySQL.
Started by Greg on
, 5 posts
by 5 people.
Answer Snippets (Read the full thread at stackoverflow):
Objective-C grammar for Lex/Yacc Flex/Bison is downloadable from....
BNF Grammars for SQL-92, SQL-99 and SQL-2003 I also found a page that lists grammars for Objective C.
There are some links from w:BNF#Language Grammers .
|
|
I'm looking for a tool that will be able to build a parser (in C#) if I give it a BNF grammar (eg. http://savage.net.au/SQL/sql-2003-2.bnf )
Does such a generator exist?
Started by ilitirit on
, 5 posts
by 5 people.
Answer Snippets (Read the full thread at stackoverflow):
How can I use these BNF grammers with TinyPG? I'm new to....
You will have to tweak the BNF a bit, but TinyPG is a great tool.
ANTLR will be probably good for what you are looking for .
Normally BNF grammars are too ambiguous.
|
|
I have to edit lots of grammar files in .bnf format. Is there a mode for this in Emacs?
I've looked at CEDET's semantic package, and it seems that it USED to have a bnf-mode, but not any more. This snippet is googlable, but semantic-bnf-mode doesn't seem...
Started by jmmcd on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
You are probably more interested in ebnf2ps, which translates ebnfThe Semantic ... .
grammar-mode are for the grammars used by CEDET, and the original bnf-mode was similar, and did not represent a real BNF style grammar.
|
Ask your Facebook Friends
|
Hi,
I would like a utility which I can give a piece of text (in a text box) and experiment with a parser grammar (through editing a BNF of similar) and token structure while I can see how the parse tree would look (and if it's not able to parse the text...
Started by Kent on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
What I tend to do when developing....
Then attach through.
You could easily use this to debug your C grammars as they are all BNF anyway! I will sure use such that you can load it and run your BNF through it and pull out the automata tables.
|
|
I have looked at the following software tools:
Ragel ANTLR BNF Converter Boost::Spirit Coco/R YACC ANTLR seems the most straight-forward, however its documentation is lacking. Ragel looks possible, too, but I do not see an easy way to convert BNF into...
Started by Dave Jarvis on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
TDParseKit ! (Most specifically, this page on Objective-C parser generation with BNF grammars)
Try.
|
|
I am trying to put together a proof of concept of an XSS-safe string interpolation scheme.
Given a string with substitutions,
"Hello <b>$planetoid</b>!"
I want break it into literal portions and substitutions ("Hello<b>" planetoid "&...
Answer Snippets (Read the full thread at stackoverflow):
Would that....
Yacc can create parsers.
State machines can only recognize regular languages and BNF can specify context-free languages.
In general, it is not possible to create a state machine for grammars that can be represented in BNF.
|
|
Is there any way to convert the following BNF into a .Net regex? (I'm not stuck on the BNF, but I thought it might be the best way to explain what I was trying to do)
<field> ::= "<<" <fieldname> <options> ">>" <options...
Started by Adam Tegen on
, 5 posts
by 5 people.
Answer Snippets (Read the full thread at stackoverflow):
I have to admit, I'm not sure I can even figure out your BNF suggests you don't need ....
:)
The recursive nature of a BNF is usually a good opening indicator that if your problem maps well to a BNF, it doesn't map well to a RegExp.
|
|
It looks like a big mess,how does it work as reference?
http://www.doctrine-project.org/documentation/manual/1_1/en/dql-doctrine-query-language%3Abnf
Answer Snippets (Read the full thread at stackoverflow):
The advantage of BNF being....
See this wikipedia article if someone want to use some automatic tool that understands BNF ; for instance, some kind of code generator.
It's Backus–Naur Form, a method of describing context free grammars.
|
|
On Thu, 23 Oct 2008 23:42:01 +1300, Tux Wonder-Dog <wes.parish@paradise.net.nz
Hi. I know it's been asked before in another forum, but has anyone written
or begun a BNF grammar of TeX?
I'm wanting it for a project I've restarted, to translate ...
Started by Tux Wonder-Dog on
, 12 posts
by 6 people.
Answer Snippets (Read the full thread at omgili):
(note no idea of the status of an (E)BNF grammar definition for
TeX, I might be able to point you.
That bnf grammars are not
capable of capturing dynamic syntax, such as tex exhibits.
|
|
On Fri, 6 Feb 2009 22:15:16 -0600, <WMiller
I wonder if anyone has given much thought to the Backus-Naur Format of what
an IF parser grammar might look like?
I have derived this (very incomplete) grammar, but perhaps others might
paste their ...
Answer Snippets (Read the full thread at omgili):
They're
provided in TADS 3 grammar syntax which is not much like Backus-Naur,
but it's similar in the....
On Fri, 6 Feb that includes about 40 rules .
That very incomplete grammars of English have about ten
thousand rules? Just saying....
|
