On 15/05/2014 08:33, Raffaello Giulietti wrote: > In section "5.1 Parser Railroad Diagrams", railroads diagrams are > compared to (presumably finite) state-machines and regular expressions. > This is misleading: neither regular expressions nor finite > state-machines have the same expressive power as the railroad diagrams > used in section 5.1 (regular versus context-free languages). > > Drop the comparision in section 5.1. Fixed, thanks! I thought of rephrasing the comparison to make it correct, but it didn’t bring much anyway so I dropped it as you suggested. > Note, though, that the analogous description in section "4.1 Token > Railroad Diagrams" is correct in that particular situation (although not > valid in general). -- Simon SapinReceived on Wednesday, 21 May 2014 14:54:54 UTC
This archive was generated by hypermail 2.4.0 : Friday, 25 March 2022 10:08:42 UTC