concept limit in category .net

This is an excerpt from Manning's book Concurrency in .NET.
For the past 50 years, the hardware industry has experienced uninterrupted improvements. Prior to 2005, the processor evolution continuously delivered faster single-core CPUs, until finally reaching the limit of CPU speed predicted by Gordon Moore. Moore, a computer scientist, predicted in 1965 that the density and speed of transistors would double every 18 months before reaching a maximum speed beyond which technology couldn’t advance. The original prediction for the increase of CPU speed presumed a speed-doubling trend for 10 years. Moore’s prediction, known as Moore’s Law, was correct—except that progress continued for almost 50 years (decades past his estimate).
Listing 9.3
AsyncRetryBuildercomputation expressiontype AsyncRetryBuilder(max, sleepMilliseconds : int) = let rec retry n (task:Async<'a>) (continuation:'a -> Async<'b>) = async { try let! result = task #1 let! conResult = continuation result #2 return conResult with error -> if n = 0 then return raise error #3 else do! Async.Sleep sleepMilliseconds #4 return! retry (n - 1) task continuation } member x.ReturnFrom(f) = f #5 member x.Return(v) = async { return v } #6 member x.Delay(f) = async { return! f() } #7 member x.Bind(task:Async<'a>, continuation:'a -> Async<'b>) = retry max task continuation #8 member x.Bind(t : Task, f : unit -> Async<'R>) : Async<'R> = async.Bind(Async.AwaitTask t, f) #9 #1 Runs the task workflow in a try-catch block #2 The operation succeeds and runs the continuation for the rest of the work. #3 The operation reached the limit of allowed reruns, and an error is thrown, stopping this computation. #4 Computation can rerun but with a delay. #5 Returns the computation itself #6 Lifts the value inside an async #7 Wraps the function inside async, so you can nest the computation in an asynchronous workflow #8 Binds the async function and its continuation, starting the retry function. If the function succeeds, then the result will feed the continuation function. #9 Shows compatibility provided for Task-based operations !@%STYLE%@! {"css":"{\"css\": \"font-weight: bold;\"}","target":"[[{\"line\":2,\"ch\":1},{\"line\":2,\"ch\":6}],[{\"line\":15,\"ch\":22},{\"line\":15,\"ch\":27}],[{\"line\":17,\"ch\":21},{\"line\":17,\"ch\":26}],[{\"line\":23,\"ch\":1},{\"line\":23,\"ch\":6}],[{\"line\":30,\"ch\":30},{\"line\":30,\"ch\":35}],[{\"line\":31,\"ch\":30},{\"line\":31,\"ch\":35}],[{\"line\":32,\"ch\":14},{\"line\":32,\"ch\":19}],[{\"line\":11,\"ch\":24},{\"line\":11,\"ch\":55}],[{\"line\":13,\"ch\":10},{\"line\":13,\"ch\":20}],[{\"line\":13,\"ch\":10},{\"line\":13,\"ch\":16}],[{\"line\":15,\"ch\":10},{\"line\":15,\"ch\":16}],[{\"line\":29,\"ch\":4},{\"line\":29,\"ch\":10}],[{\"line\":17,\"ch\":10},{\"line\":17,\"ch\":15}],[{\"line\":18,\"ch\":13},{\"line\":18,\"ch\":17}],[{\"line\":21,\"ch\":12},{\"line\":21,\"ch\":16}],[{\"line\":23,\"ch\":7},{\"line\":23,\"ch\":11}],[{\"line\":32,\"ch\":4},{\"line\":32,\"ch\":8}]]"} !@%STYLE%@!

This is an excerpt from Manning's book DSLs in Boo: Domain-Specific Languages in .NET.
Unfortunately, you usually can’t take them far enough. Mainstream languages are too inflexible in their syntax to allow you the freedom to express yourself appropriately. I have tried this approach, and I have bumped into the limits of the language several times. This approach breaks down for the interesting scenarios.
As I mentioned in chapter 1, Boo is an open language, but so far we’ve only talked about what you can do within the limits of Boo’s default syntax. You can easily modify the parser that Boo uses to make it accept a different syntax, while keeping everything else the same so you still have the benefit of running on the CLR, using the open compiler to modify the code, and so on.