Vaclav Barta wrote:
> On Wednesday 09 September 2009 11:24:06 Sam Barnett-Cormack wrote:
>> Rule templatisation might be a funky feature to be added, but it doesn't
>> exist at present, AFAIK.
> I suppose most users of such capabilities would want to make their own s
it, like an operator ?
>
>
> Cheers,
> Martin
>
>
> List: http://www.antlr.org/mailman/listinfo/antlr-interest
> Unsubscribe:
> http://www.antlr.org/mailman/options/antlr-interest/your-email-address
--
Sam Barnett-Cormack
List: http://www.
Gavin Lambert wrote:
> At 05:31 8/09/2009, Sam Barnett-Cormack wrote:
> >However, the rules I'll pass them to won't match EOF.
> >
> >It strikes me that all I need to do is make the token stream
> >wrapper *not* return an EOF. However, the docs seem to s
ever, the rules I'll pass them
to won't match EOF.
It strikes me that all I need to do is make the token stream wrapper
*not* return an EOF. However, the docs seem to specify that it *should*
return an EOF. How, practically or ideally, should I resolve this?
--
Sam Barnett-Cormack
L
e DIGs in another, you have a
problem. One solution would be to make INT and ID into parser rules, int
and id, formed as DIG+ and ENG+ respectively. That would leave a messy
tree, though.
--
Sam Barnett-Cormack
List: http://www.antlr.org/mailman/listinfo/antlr-interest
Unsubscribe:
http://www.
Graham Wideman wrote:
> "Language Processor Patterns" or "Patterns in Language Processing" (3.5
> words :-)
"Language Implementation Patterns" would be lovely if it weren't for
someone having bagged the term "implementation pattern"...
Terence Parr wrote:
> On Aug 27, 2009, at 2:34 PM, Sam Barnett-Cormack wrote:
>> I still think "Language Design Patterns" is misleading, really, as
>> it's not really about the languages, it's about recognisers and
>> other implementation issues
ot;Language Design Patterns" is misleading, really, as it's
not really about the languages, it's about recognisers and other
implementation issues. It's design, in the sense of the design of the
recogniser.
--
Sam Barnett-Cormack
List: http://www.antlr.org/mailman/listinfo/antlr-
). Of course, now I'm selling a concept for
a third book...
So I think ANTLR Design Patterns - Techniques and Strategies for
Language Implementation. Add "Domain Specific" before "Language" if the
publishers are so keen on the buzzwords. Where do you draw the line on a
guage
Implementation", or are we *not* excluding langauge design, just wanting
to make sure it's clear that implementation is there as well?
--
Sam Barnett-Cormack
List: http://www.antlr.org/mailman/listinfo/antlr-interest
Unsubscribe:
http://www.antlr.org/mailman/options/antlr-inter
UTF-16, something
from ISO-2022, whatever) to UTF-32, surrogate pairs are likely to *not*
work, as they aren't present in the resulting byte stream.
Well, that was a random outpouring...
--
Sam Barnett-Cormack
List: http://www.antlr.org/mailman/listinfo/antlr-interest
Unsubscribe:
http:
cally require branching off
the version control points for each release to add the required config,
etc etc.
Sam
> On Aug 25, 2009, at 6:37 PM, Terence Parr wrote:
>
>>
>> On Aug 25, 2009, at 2:19 PM, Sam Barnett-Cormack wrote:
>>
>>> David-Sarah Hopwood wrote:
&
rectoy
structures and suchlike used by javadoc, including a specific file I
forget the name of, that it uses to figure out which classes are under
which URL.
--
Sam Barnett-Cormack
List: http://www.antlr.org/mailman/listinfo/antlr-interest
Unsubscribe:
http://www.antlr.org/ma
't huge, it's not usually much
bother for a project website to include them, even for every release.
This is especially true when compared with the bother for *every*
project that'll use it. StringTemplate has online javadocs, the Java
Platform does (obviously), so does, for examp
So, no intetion to provide this, then, Ter et al?
Sam Barnett-Cormack wrote:
> Jim Idle wrote:
>> Sam Barnett-Cormack wrote:
>>> Tom Ball wrote:
>>>
>>>> Do you mean something other than http://antlr.org/api/Java/index.html
>>>&g
hing :(
I *believe* (I may be wrong) that you need to formulate the rule using
recursion, rather than EBNF. While (tail-)recursion and EBNF are
equivalent in matching, they produce different results in tree
constructions. I could very well be wrong, of course.
--
Sam Barnett-Cormack
List:
enVocab, explained in the context of
treegrammars at http://www.antlr.org/wiki/display/ANTLR3/4.+Tree+Parsing
--
Sam Barnett-Cormack
List: http://www.antlr.org/mailman/listinfo/antlr-interest
Unsubscribe:
http://www.antlr.org/mailman/options/antlr-interest/your-email-address
--~--~-~--~~--
t the examples (in the
> separate examples zipfile).
>
>
>
>
> --
> -safiye
>
>
> --------
>
>
> List: http://www.antlr.org/mailman/listinfo/antlr-interest
> Unsubsc
nd parsing. KEY and VALUE are identical, so
it'll never work. If you really want LINE as a lexer rule, KEY and VALUE
have to be fragment rules. It makes more sense to have a rule, say,
SYMBOL, and a rule EQ, as follows:
SYMBOL : ('a'..'z'|'A'..'Z')+
ise, there's a non-antlr solution. Pre-cache the file (ie load it
to a string buffer), check if the last character is a \n, if it isn't,
append one. Then use a relevant reader to pass the buffer to the lexer,
rather than the file.
--
Sam Barnett-Cormack
List: http://www.antlr.org/m
Jim Idle wrote:
> Sam Barnett-Cormack wrote:
>> Tom Ball wrote:
>>
>>> Do you mean something other than http://antlr.org/api/Java/index.html
>>> and http://www.stringtemplate.org/api/index.html?
>>>
>>
>> That ST one is great, but t
t
put them in.
Sam
> On Fri, Aug 14, 2009 at 3:56 PM, Sam Barnett-Cormack
> <mailto:s.barnett-corm...@lancaster.ac.uk>> wrote:
>
> I remember a conversation about this before, but now I have a specific
> request that doesn't seem to have been fulfilled.
er[]'
and 'interger[][][]' as ENTERO_V tokens.
I think there's some rethinking wants to be done between what is in the
lexer and what is in the parser. For example, isn't '[]' really an
operator, or modifier, and wants to be dealt with in the parser, not
bundled
ike this purely so that my generated javadocs
cleanly link to it, automatically (with some config).
Any chance of this happening, or if it has, where is it?
--
Sam Barnett-Cormack
List: http://www.antlr.org/mailman/listinfo/antlr-interest
Unsubscribe:
http://www.antlr.org/mailman/options/antl
es some
improvements.
> Loring Craymer wrote:
>> Not true; your example can be interpreted either as
>>
>> (expr1: PREFIX_1 (expr2: PREFIX_2 SUFFIX) SUFFIX )
>>
>> or as
>>
>> (expr1: PREFIX_1 (expr2: PREFIX_2) SUFFIX) SUFFIX
>>
>> w
g a guess, would it be okay if expr was EOF-terminated?
--
Sam Barnett-Cormack
List: http://www.antlr.org/mailman/listinfo/antlr-interest
Unsubscribe:
http://www.antlr.org/mailman/options/antlr-interest/your-email-address
--~--~-~--~~~---~--~~
You received t
> C target. Last version of Antlr
If it's a combined grammar, that'll work, but it's better in many ways
to put it in the lexer as a token.
If the lexer and parser are separate, I believe it won't work.
--
Sam Barnett-Cormack
List: http://www.antlr.org/mailman/lis
t; - but not. $addExpr.tree in the second version is always NIL.
Well, $addExpr is the result of the current parser rule, as that
expression appears to appear in the addExpr: rule. Of course it's going
to produce odd results.
--
Sam Barnett-Cormack
List: http://www.antlr.org/mailman/listin
, if you put the
output rule *inside* the optional subrule, it only applies if the
optional subrule matches. Thus the case where the subrule doesn't match
produces a single node, and where it does it produces the output you
specify.
> Goot point about the "a + b + c&quo
single node) takes place.
Your grammar doesn't appear to support expressions like
3 + 4 - 5
or
2 * 3 / 5
Sam
> --- On *Fri, 8/7/09, Sam Barnett-Cormack
> //* wrote:
>
>
> From: Sam Barnett-Cormack
> Subject: Re: [antlr-interest] could not even do k=1 for decision
messy in the end...
I'd lex $id and id entirely separately, as they are syntactically
distinct entities. $blah is always a variable, a "true" variable, and
$c->member should be three tokens - a VARIABLEID ($c), a MEMBER (->) and
an ID (member). If PHP requires there be no sp
fication you're working from
that makes whitespace 'sometimes' significant?
You example was a function call or declaration. You can always get help
from the lexer here if there are situations where there *must* be a
space, and situations where there *mustn't* be a space, and
(potentially being a
subtree themselvs).
Does this do what I think it does?
NB: constraint+ doesn't work because it can't tell how far to look
ahead. It has to finish matching one and then see if there's more.
--
Sam Barnett-Cormack
List: http://www.antlr.org/mailman/listin
references
>
>
>
> right before the method definition. Bob's your uncle, and you have
> annotations.
>
> ANTLR's output template mechanism allows you to name any action you want
> and then reference it from the output templates.
>
> Ter
>
> On Au
nd you have
> annotations.
>
> ANTLR's output template mechanism allows you to name any action you want
> and then reference it from the output templates.
So you can literrally do
@foo {blah}
and reference
?
Sam
> On Aug 1, 2009, at 1:32 PM, Sam Barnett-Cormack wrote:
&
ings (dead code,
unused local variables, unused imports...).
If there were just something, akin to @header, that appeared between the
antlr-generated imports and the actual class, that would do the trick -
for doc-comments (of the class) and for annotations.
Just a thought.
--
Sam Barnett-Corm
Hi all,
So, currently I'm using eclipse with ANTLR IDE, and it's working nicely.
I'm moving toward mavenising my work (which is broken into multiple
projects), and the bits without ANTLR use are going fine.
However, for the ANTLR bits, I'd ideally make use of maven's ANTLR
plugin to make the
er in
between - but it's a pretty easy layer. Assuming you're using Java,
create a data binding of your XML, using (for example) JAXB. Then have
the tree grammar build these Java objects, and then use JAXB's internal
capability to turn them into DOM.
Sometimes an extra step sa
back here once you've encountered a problem, and had a good bash at
it. There's lots of docs, lots of example grammars, and a very good book
available to help you learn.
--
Sam Barnett-Cormack
List: http://www.antlr.org/mailman/listinfo/antlr-interest
Unsubscribe:
http://www.antlr.
Jim Idle wrote:
> In fact antlr is an executable jar so long as you download the complete
> all-in-one jar.
>
> Java -jar ...
And in this case, the double-click wouldn't really work, as you need to
give it command-line arguments.
Sam
> On Jun 14, 2009, at 9:21 AM,
support. You have to play
> email tag with your teacher for help.
Do you have a student rep? Someone ought to be complaining.
> -Original Message-
> From: Sam Barnett-Cormack [mailto:s.barnett-corm...@lancaster.ac.uk]
> Sent: Sunday, June 14, 2009 06:21
> To: Bryan S
other bits and bobs. If you download ANTLRworks, it'll just work,
*provided* you have an up-to-date JRE (preferably JDK) installed.
If this is a course requirement, shouldn't there be support for this
from your department?
--
Sam Barnett-Cormack
List: http://www.antlr.org/mailman/li
e-clicking them. The ANTLR tool isn't an
executable jar, but ANTLRWorks will run it for you quite happily. If you
need to run it separately, you just have to use a windows command line.
If you are using a mac, I believe it's similar to windows in terms of
running things.
--
Sam Ba
Ha Luong wrote:
> Dear all,
>
> I tried to use the grammar for accepting the unicode string as follow:
> //modify T.g in the example source of ANTLR book
> grammar T;
> options {
> language=Java;
> }
> @members {
> String s;
> }
> r : ID '#' {s = $ID.text; System.out.println("found "+s);} ;
>
tating the most interesting part of the book is
>>> crazy!
>>>
>>> --
>>> uL
>>>
>>> Pragmatist
>>> http://blog.ugolandini.com
>>> http://www.flickr.com/photos/ugol/
>>>
>>> List: http://www.antlr.org/mai
Hi all,
Resolved with scoping, but I'm sure this problem is occuring more than
one might hope. Is this something the devs are considering and/or
working on?
Sam
Sam Barnett-Cormack wrote:
> Hi all,
>
> Been away from work ill for a while, and now returning to my ASN.1 pro
Hi all,
Been away from work ill for a while, and now returning to my ASN.1 project.
I'm having another hoisting issue. I have the following rule:
fixedTypeValueFieldSpec
: IOLCID t=typeOrClass
({!($t.obj)}? UNIQUE
|)
( {!($t.obj)}? valueOptionalSpec
| {$t.obj}? objectOpti
e
>>> somehow?
>> Yep. Depending on the context, you may want to either use a
>> lookahead-based entry predicate to avoid entering the rule if the DIGITs
>> aren't binary-safe, or a exit predicate that raises an error if it turns
>> out that the sequence wasn
So, I have this rule:
setting
: (LCURL)=>settingLCURL
| (LCID|externalValueReference)=>referencedValue
| typeornull
| value
| object
;
And I'm getting warnings that multiple choices can match input such as
LCID or LCURL. It's true that a lot of the options can match either, bu
Patrick Schönbach wrote:
> On 16.04.2009 17:29, Sam Barnett-Cormack wrote:
>> Why do you want the parse methods to be non-final? You can subclass
>> the lexer/parser as long as the *class* isn't final. You just can't
>> override the final methods, and it&#x
Patrick Schönbach wrote:
> Hi all,
>
> usually, AntLR generates final methods for each rule. However,
> sometimes, one would like to subclass the parser. Is there a way to
> generate non-final methods?
Why do you want the parse methods to be non-final? You can subclass the
lexer/parser as lon
ian eyberg wrote:
> On Wed, Apr 15, 2009 at 10:26:58AM -0700, William H. Schultz wrote:
>
> also I do have the current list of usernames allowed for these
> actions before I start trying to figure out what action is what;
> unfortunately since everything gets tokenized BEFORE that logic
> happ
Jim Idle wrote:
> Sam Barnett-Cormack wrote:
>> Jim Idle wrote:
>>> However, as you can obviously distinguish the cases at some point
>>> higher up the rule chain, then if you wish to pursue this, then all
>>> you need do is create a scope with your flag in
Jim Idle wrote:
> However, as you can obviously distinguish the cases at some point higher
> up the rule chain, then if you wish to pursue this, then all you need do
> is create a scope with your flag in it at a high enough level, init it
> to the default case, then set/unset it as the rules de
Sam Barnett-Cormack wrote:
> Jim Idle wrote:
>> Sam Barnett-Cormack wrote:
>>> Hi all,
>>>
>>> So, in my grammar I have need to re-use rules so they ultimately refer
>>> to a different rule (so I don't have to duplicate
>>> inter
Jim Idle wrote:
> Sam Barnett-Cormack wrote:
>> Hi all,
>>
>> So, in my grammar I have need to re-use rules so they ultimately refer
>> to a different rule (so I don't have to duplicate
>> intersection/union/exception rules). I use a parameter and gated
Sam Barnett-Cormack wrote:
> Sam Harwell wrote:
>> This will fail unexpectedly with certain types of grammars, as
>> demonstrated by some grammars I've sent to the list in the past. I'll
>> find them later today and send a link.
>
> I can't see why it&#
e. I don't think I fully understand nesting of scopes.
Sam (BC)
> -Original Message-
> From: Sam Barnett-Cormack [mailto:s.barnett-corm...@lancaster.ac.uk]
> Sent: Monday, April 13, 2009 7:55 AM
> To: Sam Harwell
> Cc: ANTLR Interest Mailing List
> Subject: Re: [antlr-
Sam Barnett-Cormack wrote:
> I guess the question really is, for me, why does it get hoisted in one
> case and not another? I'm assuming it's because of the choice in the
> objectSetSpec rule, and I can't see any way to refactor that to lose the
> choice. Of course
true and passing it...
Sam
> -Original Message- From: antlr-interest-boun...@antlr.org
> [mailto:antlr-interest-boun...@antlr.org] On Behalf Of Sam
> Barnett-Cormack Sent: Monday, April 13, 2009 6:33 AM To: ANTLR
> Interest Mailing List Subject: [antlr-interest] Pr
Hi all,
So, in my grammar I have need to re-use rules so they ultimately refer
to a different rule (so I don't have to duplicate
intersection/union/exception rules). I use a parameter and gated
predicates, like so:
elements[boolean os]
: {!$os}?=>subtypeElements
| {$os}?=>objectSetEleme
Thomas Brandon wrote:
> On Sun, Apr 12, 2009 at 6:01 AM, Sam Barnett-Cormack
> wrote:
>> I'm not sure an island grammar would work, as I need the eventual AST of the
>> "WITH SYNTAX" block to be included in the final AST of the master grammar.
>>
>&g
Thomas Brandon wrote:
> On Sun, Apr 12, 2009 at 4:45 AM, Sam Barnett-Cormack
> wrote:
>> Hi all,
>>
>> In my ongoing project, I need to parse a really crazy structure that
>> wants to change the lexing rules dependent on syntactic factors. I hate
>> this.
>
al Message-
> From: antlr-interest-boun...@antlr.org
> [mailto:antlr-interest-boun...@antlr.org] On Behalf Of Sam
> Barnett-Cormack
> Sent: Saturday, April 11, 2009 1:45 PM
> To: ANTLR Interest Mailing List
> Subject: [antlr-interest] Stupid languages, and parsing them
>
>
Sam Barnett-Cormack wrote:
> Hi all,
>
> In my ongoing project, I need to parse a really crazy structure that
> wants to change the lexing rules dependent on syntactic factors. I hate
> this.
>
>
> 1) Use member variables to track if the most recent non-WS, non-c
Hi all,
In my ongoing project, I need to parse a really crazy structure that
wants to change the lexing rules dependent on syntactic factors. I hate
this.
Within the thing I'm talking about, whitespace and comments are handled
as they are the rest of the time (thankfully). Alphanumeric tokens
;
> }
>
> This is allowed in the C99 standard, section 6.8.2, and
> by the GCC manual section 5.26 "Mixed Declarations and Code".
And explicitly not allowed by earlier "standard" (eg ISO, K&R) C
standards... do we document what standard StdCPardser is meant to t
7;-')=>('-' Integer)|) ;
This should prevent range from exiting prematurely. However, if you're
designing this language, I'd recommend getting rid of the inherent
ambiguity by putting in an expression terminator or requiring
start-and-end markers for range (pa
Foust wrote:
> Wow, Andy. So well-said.
>
> Both about the difficulty of parsing C/C++ and the state of tree walkers.
> It's so easy to shoot yourself in the foot using Antlr. It can simplify the
> initial design when you're still figuring out what you want to do, but as
> the codebase grows, yo
Ramakrishnan Venkataramani wrote:
> Hello,
> I am new to ANTLR. I am looking for a very simple SQL statement like
> SELECT and INSERT written in ANTLR grammar. I am also looking for the
> corresponding lexer, parser, and the test file (which reads the lexer,
> parser files and produces output).
Gavin Lambert wrote:
> At 00:02 2/04/2009, Sam Barnett-Cormack wrote:
> >However, k=*, it'll do whatever lookahead is needed, so there
> >isn't actually an ambiguity with LL(*). It would be silly to
> >left-factor, say:
> >
> >EVERY : &#x
standard hook interface so
that rules that *can* lead to keywords look them up. It's a fairly
standard coding pattern, AFAICT, so providing an ANTLRish way to do it
would make sense. I think it's more efficient than a rule-per-keyword
(or the equivalent, using
to-left; the
value of an assignment expression is the value that was assigned. The
AST would be like
(ASS Odd (ASS EVEN 0))
I'm sure in your case the dialect your translating to doesn't like it,
or you wouldn't be worried, but I thought it was worth mentioning as
background.
e a feeling it might be easier to break it more literally into an
equivalent of the MetaWare's presumed AST evaluation:
Even := 0;
Odd := Event;
By some tree flattening of some sort. I'd think about it more, but I
have to go and have my spine x-rayed.
--
Sam Barnett-Cormack
List:
y ambiguity warnings on any other Java implementation.
I've had similar issues with ANTLR sporadically claiming that my lexer
rules are ambiguous (they aren't unless k=1), and I would hope that my
development machine isn't considered underpowered (1.6GHz Atom, 1GB RAM,
running
Daniels, Troy (US SSA) wrote:
> The standard solution here to define fairly generic tokens in the lexer, then
> have parser rules that distinguish between them.
>
> mapping : attribute '=' attribute;
> key: ALPHA ;
> attribute: ALPHA | ALPHANUM;
> ALPHA : ('A'..'Z' | 'a'..'z')+;
> ALPHANUM : ('A
you can figure out a set of reasonable documentation
> practices for grammars, please post them to the list for discussion.
> We might learn something.
I'll be doing my initial design work (over and above the vague structure
in my head) this weekend - I'll certainly post it to th
becomes possible to produce unified documentation that, with one "group"
of webpages documenting you grammars, your templates, and your classes.
Doesn't sound too general to be useful to me.
Sam
> Sam Barnett-Cormack wrote:
>> Okay, this weekend I plan to start work on a sui
- working out an API for receiving and
outputing language information.
If there's interest in this, I can either keep the list updated, or just
those who are interested. If I get it off the ground and ANTLR folks
don't want it in the ANTLR stable, I'll sort out other hosting and
maili
25 Jim Idle mailto:j...@temporal-wave.com>>
>
> Sam Barnett-Cormack wrote:
>> Filipe David Manana wrote:
>>
>>> Hello,
>>>
>>> I am facing here something weird.
>>>
>>> I have a grammar which compiles fin
'&'": T__82, T__87, T__90
> [java]
> [java] As a result, token(s) T__87,T__90 were disabled for that input
> [java] warning(209): src/grammars/JavaScript.g:1307:1: Multiple token
> rules can match input such as "'w'": T__62, T__69, Identifier
h these. LT will still show them, I guess. Wouldn't it be
better to have the tree parser control the application of the rule by
only applying it "under" the node above? Or if this *is* at the top
level, your solution might well work, as you've demonstrated that you
only get
Gabriele Palma wrote:
> I'm modifying my working grammar. I created a new rule which does
> something previously done by another rule. I renamed the old rule and
> it is now unreferenced in the whole grammar, while old reference now
> go to the new rule. Everything seems fine, the grammar recogniz
Anders Hessellund wrote:
> Hi,
>
> I've been googling and reading FAQs for some information about how Antlr
> and Java Generics relate but nothing significant has shown up.
>
> - Does anyone here know of a good tutorial or perhaps just an example
> grammar?
>
> - One of the thing that I would l
Lucien Antlr wrote:
> Hi folks,
>
> Still wrestling with the ins and outs of the tool, I came up with
> something I expected to work but that didn't.
>
> I expected lab=(EQ expr) to assign the AST to "lab", but rather it
> always returns a null.
>
> The equivalent working statement would be
Dennis Brothers wrote:
> On Mar 23, 2009, at 2:23 PM, Sam Barnett-Cormack wrote:
>
>> Sam Harwell wrote:
>>> Why not create our own format that properly describes grammars?
>>>
>>> We could group them by the Tokens file they reference to cover
&g
Dennis Brothers wrote:
> On Mar 23, 2009, at 4:31 PM, Sam Barnett-Cormack wrote:
>
>> Dennis Brothers wrote:
>>> Since ANTLR uses ANTLR to parse itself, couldn't the ANTLR grammar
>>> be modified or extended to recognize and emit doc comments and
>>&
Dennis Brothers wrote:
> On Mar 23, 2009, at 2:23 PM, Sam Barnett-Cormack wrote:
>
>> Sam Harwell wrote:
>>> Why not create our own format that properly describes grammars?
>>>
>>> We could group them by the Tokens file they reference to cover
&g
Hi all,
We all (generally) use the default and hidden channels. What if I wanted
there to be another channel which, usually, doesn't get used, but if I
want to tune to it as well I won't get the actual whitespace? Say for
tokens that you mostly won't be interested in, but may want to
programmatic
up a quick outline-design, and
anyone who wants to help can help me nail it down to something specific,
and possibly help actually write it ;) areas that'd speed me up most
would be writing output engines and bringing extra (more experienced?)
minds to the parsing. Design usually produce
to people you
present the docs to. However, no way around that if you want to reuse
the API. It's all rather a toss-up in many ways.
Sam
> Sam Barnett-Cormack wrote:
>> Sam Barnett-Cormack wrote:
>>> Jim Idle wrote:
>>>> Sam Barnett-Cormack wrote:
>>>>
Sam Barnett-Cormack wrote:
> Jim Idle wrote:
>> Sam Barnett-Cormack wrote:
>>> Hi all,
>>>
>>> So, we use doc-comments (/** */) in our grammars. However, as far as I
>>> can tell, there's no way to auto-process these and generate nice docs.
>&
Jim Idle wrote:
> Sam Barnett-Cormack wrote:
>> Hi all,
>>
>> So, we use doc-comments (/** */) in our grammars. However, as far as I
>> can tell, there's no way to auto-process these and generate nice docs.
>> Does anyone know of one?
>>
>> *If*
Hi all,
So, we use doc-comments (/** */) in our grammars. However, as far as I
can tell, there's no way to auto-process these and generate nice docs.
Does anyone know of one?
*If* the answer is no, I'm interested in using some of my spare time to
create one. I've already looked into adapting the
Sam Barnett-Cormack wrote:
> Hey all,
>
> Say I wanted to tweak the Java target - say, create a new DoccedJava
> target that's identical apart from doing some generated doc-comments in
> the output. I know that it'd break with new versions and so on, but I'm
> h
Hey all,
Say I wanted to tweak the Java target - say, create a new DoccedJava
target that's identical apart from doing some generated doc-comments in
the output. I know that it'd break with new versions and so on, but I'm
happy to maintain it privately for my own use. I'm not saying add it to
the
Jim Idle wrote:
> Sam Barnett-Cormack wrote:
>> Terence Parr wrote:
>>>
>>> term+=(~(RSQR|LSQR)))*
>>>
>>> is your problem. known bug :) can't add sets to a list yet.
>>>
>>
>> The full rule is:
>>
>&
Terence Parr wrote:
>
> On Mar 22, 2009, at 7:49 AM, Sam Barnett-Cormack wrote:
>
>> Hi all,
>>
>> Trying to build my grammar, I get the following (including my command
>> line):
>>
>> s...@canth:~$ java -cp javalib/antlr-3.1.2/lib/antlr-3.1.2.jar
Hi all,
Trying to build my grammar, I get the following (including my command line):
s...@canth:~$ java -cp javalib/antlr-3.1.2/lib/antlr-3.1.2.jar
org.antlr.Tool -o tmp/junk workspace/asn.1-parse/grammars/ASN_1.g
error(10): internal error: workspace/asn.1-parse/grammars/ASN_1.g :
java.lang.Ille
As this compiles fine from the command-line tool, I'm going to assume
this is an ANTLR IDE problem... Edgar, any illumination on this?
Sam
Sam Barnett-Cormack wrote:
> On a separate note, trying to compile the tree grammar with these
> adjustments doesn't give me any antlr err
1 - 100 of 147 matches
Mail list logo
