S → ( T )
T → U | U , T
U → x | S
I got these two questions?
(b) Is the grammar LL (1)? (c) Is the language LL (1)?
I don’t know exactly how to figure this out? They say that you should look left recursion in this grammar? But i’cant figure out this thing?
I have a graph like this that starts from one top node and has cycles:
I need to write an algorithm to figure if
node1 depends on
node2. The most primitive algorithm I’ve written simply starts with
node1 and recursively follows all available edges looking for
node2 starting from
node1. It’s very inefficient because I traverse the graph over and over again. I’m wondering if there’s an algorithm I can look at that caches nodes and dependencies it already walked through so that I don’t go through paths I’ve walked once and can figure if there’s a dependency or not from cache?
For example, if I’m given node
D and the question is whether it depends on node
F, I’ll walk
D->E->F, and when next time I get the question if node
E depends on
F, I’ll get that from cache without walking the graph.
Thanks for any ideas and suggestions!
I received an email pretending to be from DHL about some package. Given that it was in my native language, and that it genuinely appears to come from DHL, the email seems legit. What gives that the email is 100% not legit is that it has a rar archive attached and an executable inside that I am instructed to double click to track what’s happening with the supposed package.
What surprised me is that neither BitDefender, nor Windows Defender marked it as a threat, even if I manually scanned the file.
This makes me think that this isn’t your regular let’s install a spamming software on this machine kind of a threat. This also makes me think that I may be intentionally targeted by some malware that it’s not out in the wild, but especially designed for me, which makes me even more curious to find out what it’s doing.
So what I did was to start a VM, and run it inside with ProcessMonitor recording everything it does. And it’s super boring. It doesn’t even try to connect to anything, and it doesn’t edit any files. It just checks some registries and some other system files. This means the file is 100% safe to run… in a VM.
I also submitted it to joesandbox, which confirmed me that the file is likely malicious and tries to evade virtualization.
This put me a bit at rest, because whoever would try to attack me, would likely not have this level of sophistication.
Is there any other way, but run the file on a throwaway computer, which I don’t have, to figure out what this is doing?
Here is a link to a zip containing the PML log file, but also the executable that you should definitely NOT run on any machine you care about. https://drive.google.com/file/d/1BLNQtxqgaMkXvuIw3ktWZ_lgPhlr4mtt/view?usp=sharing
looks like base64 but isn’t, what type is this..
The present state Q2,Q1,Q0 of the counter before applying the clock pulse was (101). If the input Clock frequency to the circuit is 100KHz, then the output frequency of the circuit will be ?
My Approach: I have build the table from 101 it goes to 010 and from 010 to 101 again so it acts like mod-2 counter But I don’t understand the part in which we’re applying frequency. Can someone help me to visualize it.
I have protonvpn. I am downloading torrents. I don’t want anyone to know that I am downloading torrents. I am also logged in to Facebook in my browser. So Facebook knows my VPN IP.
And my ISP knows the IP from which I am downloading stuff using UDP.
Will someone be able to figure out who I am from these sources?
I am very new to D&D 5e. The whole idea behind the character is that they can manipulate metal decently almost telekeneticaly, like throw a knife and control it in the air or tangle the bad guy up with some chains. Only issue is that I can’t figure out how the magic system works nor can I figure out how to do this with a charcter. Is there something specific like an item to make this work or should I scrap the idea?
I realised something.
While reading the core rulebook I always assumed that the relevant distance for jumping into a system was the diameter of the systems star times one hundred, and I got the impression that it would take a few days to get from safe jump distance to the spaceport. However, while I was doing some calculations based on @paul-gilfedder great answer to this question I realised that Earth is orbiting outside of our stars diameter times one hundred.
I had been assuming that if Earth had a spaceport it would take 68h with a G1 drive to get from the spaceport to a safe jump distance, and that that was pretty standard for any solar system. However, if I understand this correctly it should take only 6h 20min to get from the jump point to Earths potential starport since it is only 1.276.000 km and not 140.000.000 that I assumed.
After this longwinded intro I get to my question: When the source material talks about a system and it’s main planet/starport is there any information included that lets me know what the travel time from safe jump distance to the spaceport is, or a way to infer it from the UPW? Makes a huge difference if the planets orbit is inside our outside of the stars 100D. For instance safe jump distance to Venus would be 32.000.000 km, which is 25 times that of Earth, because of this.
let’s say the keyword “Superman” has a search volume of 250k per month. Other related search terms can be “Superman Logo” (55k), “Batman vs Superman” (60k), “Superman returns” (50k) etc. using which users search for a certain topic in Google in a country (say US). However, there may be thousands of keywords with the word “Superman” in it, and we don’t always have exact data for many of these keywords with low volume (less than 1000). In order to find the volume of these topics we use predictions based on the data that we already have for high volume keywords. For example, we may say that the term “Future Superman” will not be searched by a lot of people and its volume can be medium (close to 300). Similarly, terms “Superman image” and “Superman jacket” will have medium volume and terms that people rarely search will have low volume like “Long Sleeve Superman Shirt” (100) and then there are terms like “cheap superman shirt” or “Superman college” which will have very low volume. Can you think of an approach on how you can classify keywords into “Medium”, “Low” and “Very Low” by using some logic when we only know the high volume keywords. Your answer should be descriptive and backed by reason. (Hint- your approach may be to classify certain words which if present will make the keyword “low” volume or “very low” volume. Or your approach can be based on number of words in a keyword, spellings, where exactly a term appears in a phrase and other common human psychology that works during a search)
The website is I own both websites and are on the same server. webproof is not used and i have deleted it. but it seems that iproof transfers to webproof still. Things I have tried. 1. moving iproof ip address to a different one. 2. deleting webproof dns settings. 3. deleting webproof from web server. Just deleted the entire thing. 4. made sure the iproof dns settings were correct and did not cname to web proof.
I cant find any settings in the plesk module to transfer over to webproof. What is everyones ideas to stop the transfer.