search for: grammars

Has anyone written a grammar for LLVM for ANTLR. I mean an ANTLR grammar that parses LLVM instructions. Is an LLVM grammar available for any other parsing tool? Surinder

There's been a lot of discussion on this list about creating a formal grammar for markdown. I had a go at writing a [parsing expression grammar] for markdown. I used Haskell and John Meacham's Frisby PEG parsing library, but it should not be too hard to port the grammar to PEG libraries in other languages. [parsing expression grammar]:

Has anyone seen any attempts to give Markdown a PEG (parsing expressions grammar) recognizable by some ruby PEG parser generator grammar like Treetop? http://treetop.rubyforge.org/

...e equivalents and can do any of those > type. I probably will do a special one for this project because YACC is > a dinosaur and some of the newer ones are not exactly what I want either. > > I would like to see the many adhoc parsers in LLVM get replaced by ones > generated from grammars. > > Reed

Hello Surinder, The existing hand-written parser is callable from almost anywhere so the only reason you'd need to have a parser for it would be to extend it. Originally it was written using Flex and Bison but Chris Lattner rewrote it from scratch to catch more errors at the parsing stage. The only feature I've found to be missing from the existing LLVM-AS utility was an include

I recently subscribed and saw in the archive that Eric Astor was asking for a formal grammar (unlikely the first time for such request.) Currently there are a few problems in making such a thing so I was curious if Mr. Gruber has made any thoughts about moving toward one? This would also allow a more ?clean? parser which would get rid of some of the current problems (bad nesting[^1],

Hello Tim, Thank you for getting back to me. The language grammar as defined by the LLVM Language Reference Manual [1] does not include the details of the LLVM IR parser reference implementation. The following extract from "lib/AsmParser/LLParser.cpp" illustrates that unnamed globals are allowed [2]. > /// ParseUnnamedGlobal: > /// OptionalVisibility (ALIAS | IFUNC) ...

Respected Sir/Madam, As I was developing some part of compiler for a project. I require grammar (BNF or EBNF) for converting the C code in the IR as it is not been mentioned any where over your official website. Awaiting for your help. Regards, Vijay Daultani. M.Tech student IIT Delhi

Hi Sam, Thanks for your reply. I am implementing my research (http://www.it.usyd.edu.au/~suri/Detecting%20Buffer%20Over.pdf), a translation of LLVM to a simple non-deterministic language to detect buffer overflows. It involves (1) printing a control flow graph of basic blocks of a function (easily done) (2) translating each llvm statement to a corresponding data flow language (needs ASTs to

Hello everyone, While developing a parser for LLVM IR, I seem to have stumbled upon a potential ambiguity in the LLVM IR assembly language grammar. Most likely there is something which I may have overlooked, so wanted to reach out to a more experienced crowed for some feedback. How would the following set of tokens be interpreted [1]? declare void @foo() unnamed_addr global i32 42 As far as

...ve modifying tablegen and the main asm parser loop. We'd have to make tablegen break down each instructions in to a sequence of tokens and build a sorted matching table based on the set of these sequences. The matching loop would bisect this sorted list looking for a match. We think existing grammars would be unaffected; all existing instructions start with a mnemonic so their first token would be an identifier followed by the same sequence of tokens they currently have. Let us know if we're likely to run in to any issues making these changes or if there are other recommendations on wha...

Hi everyone, Today I tried to use the CD-ROM that came with my "Cambridge Grammar of English" on Ubuntu 8.10 and Wine 1.1.14 The install went ok, but when I try to run it I get the following error: Code: $ wine start 'C:\Program Files\Cambridge\Cambridge Grammar of English\cge.exe' fixme:exec:SHELL_execute flags ignored: 0x00000100 vwilson at

Hey Zed, any chance you mind sharing the grammar file you use with lemon to create the parser? I''ve been meaning to sit down and learn how to use one of those things. If not, any suggestions on a good resource for learning how to use a LALR parser?

Vijay Daultani wrote: > Respected Sir/Madam, > > As I was developing some part of compiler for a project. I require grammar > (BNF or EBNF) for converting the C code in the IR as it is not been > mentioned any where over your official website. I don't know what you mean by "converting the C code in the IR". Regardless, LLVM does not have BNF or EBNF forms (or any

I am curious how do you guys do it anyways? On Mon, Jul 29, 2013 at 3:27 AM, Nick Lewycky <nicholas at mxc.ca> wrote: > Vijay Daultani wrote: > >> Respected Sir/Madam, >> >> As I was developing some part of compiler for a project. I require grammar >> (BNF or EBNF) for converting the C code in the IR as it is not been >> mentioned any where over your

I would like to make a couple of small changes to the R grammar. At present, operators like ~, ==, !=, <, <=, >, >= are declared to be non-associative. This means that things like a < b <= c produce a "syntax error" message when typed. I would like to change the grammar so that these operators are left-associative. I want to make this change so that mathematical

Hello, Does a LL(k) grammar of LLVM assembly language exist somewhere ? Thanks JC

On 25 May 2016 at 16:10, Robin Eklind via llvm-dev <llvm-dev at lists.llvm.org> wrote: > declare void @foo() unnamed_addr > global i32 42 Doesn't a global have to be named? The syntax in the IR reference doesn't make it optional: @<GlobalVarName> = [Linkage] [Visibility] [DLLStorageClass] [ThreadLocal] ... Cheers. Tim.

I have two questions, but the second may not be necessary depending on the answer to this first one; in Spirit2, when creating grammars that include other grammars (that include others and so on and so forth), is it better to construct them in the grammar itself (like any other rule), or is it better to have, say, a singleton of it somewhere and link that in, and if a singleton then would it be thread-safe?

On 2016-05-26 02:42, Tim Northover via llvm-dev wrote: > On 25 May 2016 at 16:10, Robin Eklind via llvm-dev > <llvm-dev at lists.llvm.org> wrote: >> declare void @foo() unnamed_addr >> global i32 42 > > Doesn't a global have to be named? The syntax in the IR reference > doesn't make it optional: > > @<GlobalVarName> = [Linkage]