grammar

I have recently started doing a little Lua for Minecraft's mod, Computer Craft. I've always been hooked on javascript, and the tool I found the most useful was JS Lint. My question is, is there something like JS Lint that I can use to check my Lua scripts? Lua-Checker will get the job done for you. Another tool is Lua Lint There is also lua-inspect . I integrated it into ZeroBrane Studio IDE and extended the list of potential problems it reports. Here is the subset of what gets reported from one of my tests: inspect.lua(1): first assignment to global variable 'f' inspect.lua(2): first use of

I found precedence and associativity is a big obstacle for me to understand what the grammar is trying to express at first glance to haskell code. For example, blockyPlain :: Monad m => m t -> m t1 -> m (t, t1) blockyPlain xs ys = xs >>= \x -> ys >>= \y -> return (x, y) By experiment, I finally got it means, blockyPlain xs ys = xs >>= (\x -> (ys >>= (\y -> return (x, y)))) instead of blockyPlain xs ys = xs >>= (\x -> ys) >>= (\y -> return (x, y)) Which works as: *Main> blockyPlain [1,2,3] [4,5,6] [(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6)] I can get info from ghci for (>>=) as an

is it possible to invoke a rule from a different grammar? the purpose is to have two languages in the same file, the second language starting by an (begin ...) where ... is in the second language. the grammar should invoke another grammar to parse that second language. for example: grammar A; start_rule : '(' 'begin' B.program ')' //or something like that ; grammar B; program : something* EOF ; something : ... ; Your question could be interpreted in (at least) two ways: separate rules from a large grammar into separate grammars; parse a separate language inside your "main" language (island

Closed. This question is off-topic. It is not currently accepting answers. Learn more . Want to improve this question? Update the question so it's on-topic for Stack Overflow. I'm trying to implement a language (or family of languages) whose grammar can be changed dynamically. I have found no examples that serve as study cases. Can you give me some reference to any that are actually used in the real world (even from the academic world)? Does it make sense to implement a Domain-Specific Languages with a dynamic grammar? The most famous current language that has a dynamic syntax is Perl6 . The

I have markup language which is similar to markdown and the one used by SO. Legacy parser was based on regexes and was complete nightmare to maintain, so I've come up with my own solution based on EBNF grammar and implemented via mxTextTools/SimpleParse. However, there are issues with some tokens which may include each other, and I don't see a 'right' way to do it. Here is part of my grammar: newline := "\r\n"/"\n"/"\r" indent := ("\r\n"/"\n"/"\r"), [ \t] number := [0-9]+ whitespace := [ \t]+ symbol_mark := [*_>#`%] symbol_mark_noa := [_>#`%] symbol_mark_nou := [*>#`%] symbol_mark_nop := [*_>#