From b8657836f1b6aac63de9f6a618c31b2e65fba3e7 Mon Sep 17 00:00:00 2001 From: Marcin Chrzanowski Date: Sat, 2 Sep 2017 00:56:13 -0400 Subject: Update README --- README.md | 7 +++++++ 1 file changed, 7 insertions(+) diff --git a/README.md b/README.md index 9715c90..b701fd6 100644 --- a/README.md +++ b/README.md @@ -93,6 +93,7 @@ The parser recognizes the following grammar: | Die 'a' Die | Die 'T' Die | Die 't' Die + | Die ' x ' Die Semantics are defined in terms of the `pool` function. @@ -140,6 +141,9 @@ Semantics are defined in terms of the `pool` function. 0, otherwise its value is 1. * `DtE` is like `T` but dice with values *higher* than what was rolled on `D` are counted as 0's, the rest as 1's. +* `D x E` will repeatedly roll `D`. First `E` is rolled, then `D` is rolled as + many times as the value rolled on `E`. The pools generated by `D` are + concatenated to generate the new pool. Additionally: @@ -153,3 +157,6 @@ Additionally: equivalent to `1d(2d3)`, use explicit parentheses if you need `(1d2)d3`). * Die operations bind stronger than the binary arithmetic operations (`1d6 + 1d4` is equivalent to `(1d6) + (1d4)`) and the bonus operations. +* The repetition operation ` x ` is left assosiative. It binds stronger than + the standard arithmetic operations, but weaker than the dice operations and + the bonus operations. -- cgit v1.2.3