Path: utzoo!attcan!uunet!oddjob!ncar!ames!pasteur!ic.Berkeley.EDU!faustus From: faustus@ic.Berkeley.EDU (Wayne A. Christopher) Newsgroups: comp.lang.misc Subject: Re: What makes a language "easy" to program in? Message-ID: <3799@pasteur.Berkeley.Edu> Date: 6 Jun 88 20:59:00 GMT References: <711@cunixc.columbia.edu>Sender: news@pasteur.Berkeley.Edu Distribution: comp Lines: 9 I have a question for the APL users out there. I'm used to programming with C pointers, which make it easy to write any sorts of strange data structures you want. As far as I can tell, APL only gives you arrays (very powerful arrays, of course). How easy is it to use data structures like trees, queues, and lists in APL? It it necessary to simulate them with arrays like you would do in fortran, or are there other ways to get around the problem? Wayne