User loginNavigation |
generating interpreters, IDEs, etc., from simple specifications?I've been wondering about this for a while, google and LtU archives didn't bring up anything: My understanding is that BNF (or EBNF) as it is usually used by parser-generators is not strong enough for this task because: Regarding the first problem, I found the following from CTM (p. 641, last paragraph) interesting: Doesn't this mean that we can describe a general grammar which is good not only for parsing, but also for extracting a simple, clean AST (let's say we accept the slow speed for the sake of building an easy language-prototyping system). Regarding the semantics of a language: why couldn't we use some sort of operational semantics, the way they are described in Pierce's TAPL (actually PVR has has an SOS in CTM...lol :) ) In other words, given the following: (I understand that many existing languages are not easy to define using TAPL type rules...perhaps a system such as this, with all its benefits, will encourage non-expert language creators to put more thought into semantics) By shahbaz at 2006-08-23 03:02 | LtU Forum | previous forum topic | next forum topic | other blogs | 8408 reads
|
Browse archives
Active forum topics |
Recent comments
17 weeks 4 days ago
17 weeks 4 days ago
17 weeks 4 days ago
39 weeks 5 days ago
44 weeks 17 hours ago
45 weeks 4 days ago
45 weeks 4 days ago
48 weeks 2 days ago
1 year 6 days ago
1 year 6 days ago