What I post is relevant and on-topic and you have outed yourself as an actual paid shill. I’ll give you a tip, don’t advocate for censorship so openly. Even if you do, there are discreet ways to do so.
Censorship is about you being limited in the actions you can take to express yourself. It is not about cushioning you from the consequences of those actions from the people around you.
You obviously were allowed to take action: The contents was apparent upon on a forum and here as well. People reacted to your actions: Admins removed your contents and blocked you and I am telling you that your understanding of wayland as well as politics is limited.
github.com/mu-semtech/sparql-parser contains an EBNF parser for SPARQL, an LL(1) language. You might be able to borrow code, not sure how well it translates to scheme. GitHub asked me to log in to see the gist so I’d have to have a peek later.
sparql-ast folder contains the relevant bits regarding the parsing.
It looks alright. You’ll have to use it for a few months before knowing whether it’s comfortable.
To be honest, I’m not a fan of variables; I’m in the tacit/concatenative camp. But I think it’s good to try new things and learn for yourself why they are good or bad.
You showed up! So, about this, you see how ‘let’ binding does not allow you to add parameters right? (the val binding does) I think this is a good place to use tacitness. I will basically add Perl-like, POSX-shell-like features. To further add concatativenss, I shall add OCaml-style shell (|>). I will take a page from F#'s book and add a ‘<|’ too. I was originally planning to have these two operators be defined orthogonal-like via the operator binders (infix, infixr etc) but I think it’s necessary to bake them in.
So any other cool stuff? I plan on having intrinsics like ‘add’ and ‘or’ etc. Since it is translated down to C, I will add a two-way FFI, similar to the language I am writing it in, Cyclone Scheme.
Check out my DSL I made for Python in Shell. github.com/dislux-hapfyl/shimkyI checked out all your projects on GitHub. You are a Super Programmer for sure.
Cool. I can’t see the implementation though? Thanks a lot man. Really means a lot. @Corbin knows a lot more though. (since I called Rust a ‘shitlang’ I realize you may be ironic — Since Rust is more of a ‘fandom’ than a ‘compiler’, but I’m not going to offend you by assuming so. If you are truly giving me props, it’s really appreciated! :D )
Why ‘exactly’ is it bad that people are still using C, a language with 4 decades of toolchain and library build-up, instead of a shitlang like Rust that is mainly used to create garbage webapps?
Cool, as I just said, Rust is more of a ‘fandom’ than a ‘compiler’ really, it’s also not much of a ‘language’. I use C because it’s standardized by ISO, not some basement-dwelling incels who keep RFCi’ing their ideas instead of implementing it their own.
I’d say you’re misinformed, but it requires some real idiocy to be that badly misinformed and that deliberately insulting to a whole programming language community.
Not really, because the search term can match anywhere in the name. Also it searches in executable name (app id) and the app name, a descriptive text. So its more than a Bash completion would be.
Can we just have flatpak apps added to the system path by default? Like have a directory /usr/local/flatpak/bin and have links to all the executable show up there. Then users can choose to add that to their path if they wish.
No need to feel silly. If you didn’t ask, you wouldn’t learn about it. I learned about it yesterday in the post where I initially gave the first version of the script. It’s a documentation issue I would say, in some way. Such an important part should have been made clear for every user.
I “insist” you feel not sorry, because I’m in the same boat as you. :D
Or if it makes you uncomfortable to change the placement of this folder in the $PATH, instead you can just add a new directory solely for this purpose. In example add “/home/yourname/.local/flatpak/bin” (or whatever else you like) and put it in front of the flatpak exports directory.
those commands are gold! Thank you for sharing! Saved them. They work flawlessly so far.
If flatpak search would work with fzf, it would be easier to use and faster than GNOME software
edit:
I added echo “${app}” to flatapp in order to print the app in terminal to have a visual response which app will run. (some apps take some seconds to open on my slow machine)
I thought about additional echo for confirmation too! I will add it too (give me 2 minutes), but it will output to stderr, so it’s not part of regular output.
Hey, I just created a search with fzf menu for install or uninstall app. It’s not pretty, because its a bit unorganized looking and I could not find a good and easy way to solve this. But it seems to be working so far.
Congratulations on taking a step towards self-hosting and meta-circular compilation. ASDL is a great intermediate meta-language and it can be used to abstract any sort of Builder or Command workflow. This is sometimes called a “narrow waist”; ASDL replaces ad-hoc AST-builder objects with a unified protocol and interface.
Can you tell me what you think of the code my implementation emits when you got the time? Is it good, bad, medicore etc?
So when you’re building a language, should you always use a builder for the AST specifications? Becuase I figure, you don’t need that in a language like Haskell or OCaml right?
I currently have 3 projects I ping-pong.
1- Marsh, a POSIX shell in C; 2- Awk2X; a translator of AWK to several languages, like C, Python Rust etc. This one is in Haskell 3- Cephyr; a C compiler in OCaml
For Marsh, I am stuck in the job control section. I just can’t seem to find a flow for redirecting input and output. I think I am striking a balance though. I revised the job control like 10 times, literally 10 times.
But for Awk2X and Cephyr, I am kinda stuck at defining the AST. I learned Haskell just last night and I made this AST. I am not ‘stuck’ really, I will move on from it soon.
It’s still incomplete. I just found out I can use .mli files.
I think Cephyr is the 5th reincaation of my OCaml C compiler. I just spend hours at the AST and get tired of it.
I found lcc, by Fraiser et al:
[github.com/drh/lcc
And I have the book too. I like the book but it’s kinda useless for me because I wanna do SSA. These kinda tree-rewriting mumbo jumbo is too 80s for my taste.
Your code looked alright. Working in C is a risky chore. You’re early in your journey and I think it’s good to get a taste of many of the traditional techniques before turning towards newer fancier algorithms.
“Haskell and OCaml”, hm? The two concepts you need to internalize are katamorphisms and paramorphisms. You may have heard of “recursion schemes”; these two schemes are the ones available on any tree. Fundamentally, most of a compiler is tree-to-tree transformations (nanopasses), and they are expressible as one of two forms:
Katamorphism: The leaves of each node are transformed before the branch (bottom-up)
Paramorphism: The leaves are transformed after/during the branch transformation (top-down)
If you look again at my AST builder builder, you’ll see .run() and .walk() methods, implementing the recursion for any katamorphism or paramorphism respectively. In Haskell, these are called Traversable types. This is a pun in Monte, where .run() is also the default method; the syntax makes it easy to perform a katamorphism by passing a tree-traversing object directly to the AST.
Your types are alright, but you’ll want to pass a generic parameter through them, turning them into a valid Functor in Haskell or a generic module in OCaml. This is a basic defense against the “AST Decoration Problem”, AKA the “AST Typing Problem”. As you add features to your compiler, you’ll realize why these are necessary.
(Sorry if this is a double post) I think what you call ‘decoration’ I call 'augmentation;. After many iterations ,I came up with this AST: pastebin.com/NA1DhZF2
I like it, but I am still skeptical as of comitting to it. I really want to use Functors… But i’m nto sure how. These are new concepts to me!
there are typos in lines 118 (asyncp), 202 (substitue), 346 (bracketet; also see line 352) and 386 (asnyc), and in line 346 you did not update the names from brack to bracket, and in line 283 (and consequently also line 320) the word order should probably be redirect-output-append
Apologies. I will definitely fix them. Do you notice any more errors? I myself just realize that-- path expansion could be replaced with actual rules. Thanks again.
A parte gli scherzi che uno può fare, non saprei a cosa possa servire realmente. Di sicuro creare un audiolibro in modo gratuito potrebbe fare gola a tanti. Mi viene in mente il “calibro”…
gist.github.com
Hot