Eclipse IDE Compatiablity

[marcusob]

Hi,

I was wondering if there is any Eclipse plugins for pop 11. If not I think I will implement a plugin for it, so it at least support the pop11 tool chain, VM configuration and editor features such as syntax highlighting etc.

Anyone interested in how I progress with this ? I might add my progress to a blog.

Thanks.

--
marcusob
http://compgroups.net/comp.lang.pop/

[no.to...@gmail.com]

In article <87mdnY_wbqeYUQHL...@giganews.com>, marcusob <MARCUS...@YAHOO.COM> wrote:

> Hi,
>
> I was wondering if there is any Eclipse plugins for pop 11.
> If not I think I will implement a plugin for it, so it at least support the pop11 tool chain,
> VM configuration and editor features such as syntax highlighting etc.
>

I'd like syntax highlighting, but what is the 'etc'.

> Anyone interested in how I progress with this ? I might add my progress to a blog.
>

Eclipse is java, isn't it? What happened to java? And 'sun'?
Was it like comp.lang.pop after Aaron Sloman retired?
----
Jonathan wrote:-
](b) A pop11 compiler written in lisp would
]run on any of the (many) Common Lisp implementations. Some of them
]have very efficient compilers, and there is a Common Lisp implementation
](or a similar dialect) that is implemented to run on the JVM. So you
]would get that for free.

I was very keen on poplog at one time. I've got v15.53 installed.
Has there been any updates in recent years? I tried some pml. It works.

Now I badly want to understand how <non imperative languages like
haskell 'work'>. I guess that it's similar to ML, which is 'hosted' by
poplog. So if you analyse the poplog implementation of ML, you may
get a good idea of how Haskell works.

Haskell users seem very hairy-fairy-hand-wavers: mostly just saying
<it feels nice> and repeating cliches. Some good photostat pages,
explained that the <ML machine> does reductions on expressions.

Since I know how a recursive descent PASCAL compiler would 'reduce'
eg. the boolean: 4 * (2+3) < Max(dog, fish)
to: 20 < N
I can't wait to know how the 'inference' is done by Haskell,
after the reductions are done - I'm guessing.
I used to know about prolog's <unification> method, which
seems related - to Haskell's inference.
And since poplog handles prolog too, it seems that all the
secrets will be revealed in poplog, which is a much easier language to
analyse than eg. C++

WDYS?