Update README with new versions of dice operations

1 files changed, 8 insertions, 0 deletions

diff --git a/README.md b/README.md
index 2d7473f..d5cbbbc 100644
--- a/README.md
+++ b/README.md
@@ -84,10 +84,13 @@ The parser recognizes the following grammar:
           | Die '-' Die
           | '-' Die
           | Die 'E' Die
+          | Die 'e' Die
           | Die 'K' Die
           | Die 'k' Die
           | Die 'A' Die
+          | Die 'a' Die
           | Die 'T' Die
+          | Die 't' Die
 
 Semantics are defined in terms of the `pool` function.
 
@@ -112,6 +115,7 @@ Semantics are defined in terms of the `pool` function.
   value rolled on `D`. The die's result is the sum of all those rolls. *Note:*
   this could lead to an infinite evaluation if `F` always rolls higher than a
   possible result of `D`.
+* `DeF` is like `E`, but explodes on values *less* than what was rolled on `D`.
 * `DKE` is the "keep highest" mechanic. First `D` is rolled. Now each die in the
   dice pool generated by `E` is rolled, and the resulting dice pool is composed
   of those dice that rolled highest, taking up to as many dice as the result of
@@ -123,9 +127,13 @@ Semantics are defined in terms of the `pool` function.
   something less than the value rolled on `D`. Each such roll is treated as a
   separate die, the results for each die are not accumulated like with exploding
   die.
+* `DaE` is like `A`, but rolls again on values *less* than what was rolled on
+  `D`.
 * `DTE` applies a threshold to the dice in `E`'s pool. First `D` is rolled. Now
   when a die from `E`'s pool rolls below the value rolled on `D`, its value is
   0, otherwise its value is 1.
+* `DtE` is like `T` but dice with values *lower* than what was rolled on `D` are
+  counted.
 
 Additionally: