Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

7
  • I honestly don't understand what you are trying to achieve here. Commented Oct 27, 2012 at 15:47
  • I was hoping to use enums for grammar parsing (with a defined set of symbols). This would mean that Symbol.A and Symbol.B can be used to construct a word that has been defined in the Production enum. But the implementation that I've presented doesn't allow for constructing Production.BA. Hope that clears it a bit. Commented Oct 27, 2012 at 16:04
  • On a side note: Enums decorated with [Flags] should be plural. Normal enums should be singularized. SO Reference stackoverflow.com/questions/1405851/… Commented Oct 27, 2012 at 16:16
  • Your fundamental problem is that X | Y is the same as Y | X. That is the way the OR operator works. Back to the drawing board. Commented Oct 27, 2012 at 16:21
  • Thanks Steve, as I've mentioned in my post - I do understand why this is happening, I'm just wondering if there is a combination of bitwise operators that I could use to achieve what I want. Commented Oct 27, 2012 at 16:26