Reposted this as a new messsage (orgiginally I asked for the BNF grammar of HL7). Whilst it may be possible to express all of HL7 as BNF I need my BNF to be LALR(1) complaint (completely deterministic). Devon Cooks Gold Parser is the toolset.
Just figured I 'd ask before I started creating BNF myself...
I do not see a reason why HL7 is not expressable as BNF, and from what I have read, it looks like it will comply with LALR(1). My reasoning is because HL7 is a standard, and therefore has a finite set of ways a message can be put together and therefore parsed. After researching the internet I am unable to find a BNF that you are looking for, so if you do create a BNF please see if you can share it with the hl7.org community! Good Luck.