Maxime Perrotin

@usr3-1415 can you please evaluate the complexity? If you can reuse the mechanisms used for named integers or enumerant with values, I'm in favour of supporting this ASN.1 syntax, which...

Thank you! I did find a few issues, given this grammar: Test DEFINITIONS ::= BEGIN SomeBits ::= BIT STRING { read(1), write(2), execute(99) } (SIZE(100)) MoreBits ::= BIT STRING {...

The C version cannot work either with the pattern suggested by @hmpcabral Since the bit string is translated into an array of bytes, the constants could only work with the...

One more thing, quoting the book from Mr. Dubuisson: > Concerning the ordering of the bits, the following convention was adopted: the first bit of the string is the one...

It is there now. Given this grammar: ``` Foo DEFINITIONS ::= BEGIN Seq ::= SEQUENCE { innerChoice CHOICE { option1 BOOLEAN, option2 INTEGER (0..233) } } END ``` You can...

Fixed in release 4.3.1.3: https://github.com/ttsiodras/asn1scc/releases/tag/4.3.1.3

Hi, we are going to integrate your contribution in the future version of ASN1SCC, but this will require some additional refactoring which is not ready yet. We are trying to...

Hi Luis, Is your grammar recursive? That would be causing this error. For example if you have such a grammar: ``` D DEFINITIONS ::= BEGIN Foo ::= SEQUENCE { a...

I think this is now implemented Given this parameterized type: ``` Foo DEFINITIONS ::= BEGIN Seq {Foo, INTEGER:end-point} ::= SEQUENCE { innerChoice CHOICE { option1 Foo, option2 INTEGER (0..end-point) }...

Also true when using the form: ``` {{linesGlobal|join('\n')}} ``` This form does not behave as one would expect - since jinja2 is the one emmitting the newlines, it should make...