I'm not parsing this discussion; could you clarify? The published LRM specifies type-checks, an errata is on file saying we don't check. When the "errata is fixed", will the LRM continue to say that relationals between enums must check their strict types? Or will the errata be retracted? One reason few, if any, implementations check this error is because their type-balancing lattice may prefer to rewrite enums as base-type literals earlier than the checking rule requires. The progress of (System)Verilog type determination is already one of the deepest mysteries in IEEE-1800 On 3/23/2014 4:12 AM, Bresticker, Shalom wrote: > I did. It is Mantis 4708. > >> The one exception is to fix the errata in the LRM Shalom noted >> in this e-mail thread that says the strong type checking applies to >> relational operators on enumerated labels. This errata is something I >> discussed with Shalom last year, and I thought he had filed a Mantis > item >> about it. All simulators and synthesis compilers I have checked ignore >> that errata. > --------------------------------------------------------------------- > Intel Israel (74) Limited > > This e-mail and any attachments may contain confidential material for > the sole use of the intended recipient(s). Any review or distribution > by others is strictly prohibited. If you are not the intended > recipient, please contact the sender and delete all copies. > > -- This message has been scanned for viruses and dangerous content by MailScanner, and is believed to be clean.Received on Mon Mar 24 12:05:52 2014
This archive was generated by hypermail 2.1.8 : Mon Mar 24 2014 - 12:05:56 PDT